



def 					__lowerCAmelCase		(  __lowerCamelCase	:    Optional[int]	)  ->						str:
					__lowerCAmelCase	   =len(__lowerCamelCase	)
					while cur > 1:
										# Find the maximum number in arr
										__lowerCAmelCase	   =arr.index(max(arr[0:cur]	)	)
										# Reverse from 0 to mi
										__lowerCAmelCase	   =arr[mi::-1] + arr[mi + 1 : len(__lowerCamelCase	)]
										# Reverse whole list
										__lowerCAmelCase	   =arr[cur - 1 :: -1] + arr[cur : len(__lowerCamelCase	)]
										cur -= 1
					return arr


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









def 					__lowerCAmelCase		(  )  ->						Tuple:
					__lowerCAmelCase	   =[]
					__lowerCAmelCase	   =1

					while len(__lowerCamelCase	) < 1E6:
										constant.append(str(__lowerCamelCase	)	)
										i += 1

					__lowerCAmelCase	   ="""""".join(__lowerCamelCase	)

					return (
					    int(constant[0]	)
					    * int(constant[9]	)
					    * int(constant[99]	)
					    * int(constant[999]	)
					    * int(constant[9999]	)
					    * int(constant[99999]	)
					    * int(constant[999999]	)
					)


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




