





def   __lowerCamelCase   (				__a  :str       )						->							int:






		"""simple docstring"""

		assert column_title.isupper()
		A__     =  0
		A__     =  len(__a       ) - 1
		A__     =  0

		while index >= 0:
				A__     =  (ord(column_title[index]       ) - 6_4) * pow(2_6       ,	__a       )
				answer += value
				power += 1
				index -= 1

		return answer


if __name__ == "__main__":
					from doctest import testmod

					testmod()










def   __lowerCamelCase   (				__a  :Optional[Any]       )						->							Tuple:






		"""simple docstring"""

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


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



