
import math





def 			lowerCamelCase_ (				lowerCamelCase__    ):
				lowerCamelCase_						=			[True] * n
				lowerCamelCase_						=			False
				lowerCamelCase_						=			False
				lowerCamelCase_						=			True

				for i in range(3	, int(n**0.5 + 1    )	, 2    ):
								lowerCamelCase_						=			i * 2
								while index < n:
												lowerCamelCase_						=			False
												lowerCamelCase_						=			index + i

				lowerCamelCase_						=			[2]

				for i in range(3	, lowerCamelCase__	, 2    ):
								if is_prime[i]:
												primes.append(lowerCamelCase__    )

				return primes





def 			lowerCamelCase_ (				lowerCamelCase__ = 9_9_9_9_6_6_6_6_3_3_3_3    ):
				lowerCamelCase_						=			math.floor(math.sqrt(lowerCamelCase__    )    ) + 1_0_0
				lowerCamelCase_						=			prime_sieve(lowerCamelCase__    )

				lowerCamelCase_						=			0
				lowerCamelCase_						=			0
				lowerCamelCase_						=			primes[prime_index]

				while (last_prime**2) <= limit:
								lowerCamelCase_						=			primes[prime_index + 1]

								lowerCamelCase_						=			last_prime**2
								lowerCamelCase_						=			next_prime**2

								# Get numbers divisible by lps(current)
								lowerCamelCase_						=			lower_bound + last_prime
								while upper_bound > current <= limit:
												matches_sum += current
												current += last_prime

								# Reset the upper_bound
								while (upper_bound - next_prime) > limit:
												upper_bound -= next_prime

								# Add the numbers divisible by ups(current)
								lowerCamelCase_						=			upper_bound - next_prime
								while current > lower_bound:
												matches_sum += current
												current -= next_prime

								# Remove the numbers divisible by both ups and lps
								lowerCamelCase_						=			0
								while upper_bound > current <= limit:
												if current <= lower_bound:
																# Increment the current number
																current += last_prime * next_prime
																continue

												if current > limit:
																break

												# Remove twice since it was added by both ups and lps
												matches_sum -= current * 2

												# Increment the current number
												current += last_prime * next_prime

								# Setup for next pair
								lowerCamelCase_						=			next_prime
								prime_index += 1

				return matches_sum


if __name__ == "__main__":
			print(solution())




import math





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__ = 0	, lowerCamelCase__ = 0    ):
				lowerCamelCase_						=			end or len(lowerCamelCase__    )
				for i in range(lowerCamelCase__	, lowerCamelCase__    ):
								lowerCamelCase_						=			i
								lowerCamelCase_						=			array[i]
								while temp_index != start and temp_index_value < array[temp_index - 1]:
												lowerCamelCase_						=			array[temp_index - 1]
												temp_index -= 1
								lowerCamelCase_						=			temp_index_value
				return array





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    ):  # Max Heap
				lowerCamelCase_						=			index
				lowerCamelCase_						=			2 * index + 1  # Left Node
				lowerCamelCase_						=			2 * index + 2  # Right Node

				if left_index < heap_size and array[largest] < array[left_index]:
								lowerCamelCase_						=			left_index

				if right_index < heap_size and array[largest] < array[right_index]:
								lowerCamelCase_						=			right_index

				if largest != index:
								lowerCamelCase_	,    lowerCamelCase_						=			array[largest], array[index]
								heapify(lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    )





def 			lowerCamelCase_ (				lowerCamelCase__    ):
				lowerCamelCase_						=			len(lowerCamelCase__    )

				for i in range(n // 2	, -1	, -1    ):
								heapify(lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    )

				for i in range(n - 1	, 0	, -1    ):
								lowerCamelCase_	,    lowerCamelCase_						=			array[0], array[i]
								heapify(lowerCamelCase__	, 0	, lowerCamelCase__    )

				return array





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    ):
				if (array[first_index] > array[middle_index]) != (
				    array[first_index] > array[last_index]
				):
								return array[first_index]
				elif (array[middle_index] > array[first_index]) != (
				    array[middle_index] > array[last_index]
				):
								return array[middle_index]
				else:
								return array[last_index]





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    ):
				lowerCamelCase_						=			low
				lowerCamelCase_						=			high
				while True:
								while array[i] < pivot:
												i += 1
								j -= 1
								while pivot < array[j]:
												j -= 1
								if i >= j:
												return i
								lowerCamelCase_	,    lowerCamelCase_						=			array[j], array[i]
								i += 1





def 			lowerCamelCase_ (				lowerCamelCase__    ):
				if len(lowerCamelCase__    ) == 0:
								return array
				lowerCamelCase_						=			2 * math.ceil(math.loga(len(lowerCamelCase__    )    )    )
				lowerCamelCase_						=			1_6
				return intro_sort(lowerCamelCase__	, 0	, len(lowerCamelCase__    )	, lowerCamelCase__	, lowerCamelCase__    )





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    ):
				while end - start > size_threshold:
								if max_depth == 0:
												return heap_sort(lowerCamelCase__    )
								max_depth -= 1
								lowerCamelCase_						=			median_of_a(lowerCamelCase__	, lowerCamelCase__	, start + ((end - start) // 2) + 1	, end - 1    )
								lowerCamelCase_						=			partition(lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    )
								intro_sort(lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    )
								lowerCamelCase_						=			p
				return insertion_sort(lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    )


if __name__ == "__main__":
			import doctest

			doctest.testmod()

			__A				=input('''Enter numbers separated by a comma : ''').strip()
			__A				=[float(item) for item in user_input.split(''',''')]
			print(sort(unsorted))


