
def    a      ( a = 10**12	)     ->int:




			'''simple docstring'''


			SCREAMING_SNAKE_CASE     						= 1
			SCREAMING_SNAKE_CASE     						= 0

			SCREAMING_SNAKE_CASE     						= 1
			SCREAMING_SNAKE_CASE     						= 1

			while numerator <= 2 * min_total - 1:
						prev_numerator += 2 * numerator
						numerator += 2 * prev_numerator

						prev_denominator += 2 * denominator
						denominator += 2 * prev_denominator

			return (denominator + 1) // 2


if __name__ == "__main__":
							print(F'''{solution() = }''')

def    a      ( a	)     ->List[Any]:




			'''simple docstring'''


			SCREAMING_SNAKE_CASE     						= len(a	)
			while cur > 1:
						# Find the maximum number in arr
						SCREAMING_SNAKE_CASE     						= arr.index(max(arr[0:cur]	)	)
						# Reverse from 0 to mi
						SCREAMING_SNAKE_CASE     						= arr[mi::-1] + arr[mi + 1 : len(a	)]
						# Reverse whole list
						SCREAMING_SNAKE_CASE     						= arr[cur - 1 :: -1] + arr[cur : len(a	)]
						cur -= 1
			return arr


if __name__ == "__main__":
							__lowerCAmelCase					   =       input('Enter numbers separated by a comma:\n').strip()
							__lowerCAmelCase					   =       [int(item) for item in user_input.split(',')]
							print(pancake_sort(unsorted))