





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







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


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

		testmod()










'''simple docstring'''


def    _lowerCamelCase  (__lowerCamelCase  :     int = 400_0000     )   ->    int:
			a__     = [0, 1]
			a__     = 0
			while fib[i] <= n:
						fib.append(fib[i] + fib[i + 1]     )
						if fib[i + 2] > n:
									break
						i += 1
			a__     = 0
			for j in range(len(__lowerCamelCase     ) - 1     ):
						if fib[j] % 2 == 0:
									total += fib[j]

			return total


if __name__ == "__main__":
		print(f"""{solution() = }""")



