



def 							A			(  _UpperCAmelCase       :     List[Any]					)       ->				List[str]:







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


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





def 							A			(  _UpperCAmelCase       :     int							,     _UpperCAmelCase       :     int					)       ->				int:







			'''simple docstring'''
			while second != 0:
						_UpperCAmelCase	 =     first & second
						first ^= second
						_UpperCAmelCase	 =     c << 1
			return first


if __name__ == "__main__":
							import doctest

							doctest.testmod()

							UpperCAmelCase__     = int(input("Enter the first number: ").strip())
							UpperCAmelCase__     = int(input("Enter the second number: ").strip())
							print(f"""{add(first, second) = }""")
