






def       __lowerCAmelCase      (						__snake_case					, __snake_case       ):
     if a < 0 or b < 0:
          raise ValueError("the value of both inputs must be positive"       )
     __lowerCAmelCase								=					str(bin(__snake_case       )       )[2:]  # remove the leading "0b"
     __lowerCAmelCase								=					str(bin(__snake_case       )       )[2:]
     __lowerCAmelCase								=					max(len(__snake_case       )					, len(__snake_case       )       )
     return "0b" + "".join(
         str(int("1" in (char_a, char_b)       )       )
         for char_a, char_b in zip(a_binary.zfill(__snake_case       )					, b_binary.zfill(__snake_case       )       )       )


if __name__ == "__main__":
 import doctest

 doctest.testmod()














def       __lowerCAmelCase      (						__snake_case       ):
     __lowerCAmelCase								=					len(__snake_case       )
     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(__snake_case       )]
          # Reverse whole list
          __lowerCAmelCase								=					arr[cur - 1 :: -1] + arr[cur : len(__snake_case       )]
          cur -= 1
     return arr


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






