
'''simple docstring'''



def A (__lowerCamelCase :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  __magic_name__  (				lowercase = 1000				)				-> int:

							"""simple docstring"""



							lowercase_				,		lowercase_	:   Optional[Any]  				=     1, 1
							lowercase_	:   Tuple  				=     2
							while True:
														lowercase_	:   Dict  				=     0
														lowercase_	:   List[Any]  				=     fa + fa
														lowercase_				,		lowercase_	:   List[str]  				=     fa, f
														index += 1
														for _ in str(lowercase				):
																					i += 1
														if i == n:
																					break
							return index


if __name__ == "__main__":
							print(solution(int(str(input()).strip())))