




'''simple docstring'''

def 						__magic_name__       (      __UpperCAmelCase      )						->   int:

					'''simple docstring'''

					snake_case_		     =							int(__a      )
					if decimal in (0, 1):  # Exit cases for the recursion
										return str(__a      )
					snake_case_		     =							divmod(__a, 2      )
					return binary_recursive(__a      ) + str(__a      )


def 						__magic_name__       (      __UpperCAmelCase      )						->   int:

					'''simple docstring'''

					snake_case_		     =							str(__a      ).strip()
					if not number:
										raise ValueError('''No input value was provided'''      )
					snake_case_		     =							'-' if number.startswith('''-'''      ) else ''
					snake_case_		     =							number.lstrip('''-'''      )
					if not number.isnumeric():
										raise ValueError('''Input value is not an integer'''      )
					return F"{negative}0b{binary_recursive(int(__a      )      )}"


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

							testmod()






"""simple docstring"""







def     UpperCAmelCase_					(				__a   :			list						):




			'''simple docstring'''



			if len(__a						) <= 1:
						return lst

			_lowerCamelCase					:					str	       =    1

			while i < len(__a						):
						if lst[i - 1] <= lst[i]:
									i += 1
						else:
									_lowerCamelCase       ,							_lowerCamelCase					:					Optional[Any]	       =    lst[i], lst[i - 1]
									i -= 1
									if i == 0:
												_lowerCamelCase					:					Dict	       =    1

			return lst


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





