
def 	a_		(	__lowercase       :     int			)			->  str:
			_snake_case          =      int(__lowercase			)
			if decimal in (0, 1):  # Exit cases for the recursion
						return str(__lowercase			)
			_snake_case     , _snake_case          =      divmod(__lowercase	, 2			)
			return binary_recursive(__lowercase			) + str(__lowercase			)






def 	a_		(	__lowercase       :     str			)			->  str:
			_snake_case          =      str(__lowercase			).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(__lowercase			)			)}'''


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

			testmod()

import baseaa






def 	a_		(	__lowercase       :     str			)			->  bytes:
			return baseaa.aaaencode(string.encode('utf-8'			)			)






def 	a_		(	__lowercase       :     bytes			)			->  str:
			return baseaa.aaadecode(__lowercase			).decode('utf-8'			)


if __name__ == "__main__":
			import doctest

			doctest.testmod()