





'''simple docstring'''





def    __UpperCamelCase      (    a) ->str:
					lowerCamelCase__       =       int(_A)
					if decimal in (0, 1):  # Exit cases for the recursion
										return str(_A)
					lowerCamelCase__    ,		lowerCamelCase__       =       divmod(_A,     2)
					return binary_recursive(_A) + str(_A)





def    __UpperCamelCase      (    a) ->str:
					lowerCamelCase__       =       str(_A).strip()
					if not number:
										raise ValueError("No input value was provided")
					lowerCamelCase__       =       "-" if number.startswith("-") else ""
					lowerCamelCase__       =       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()








def    __UpperCamelCase      (    a = 100) ->int:
					lowerCamelCase__       =       (n * (n + 1) // 2) ** 2
					lowerCamelCase__       =       n * (n + 1) * (2 * n + 1) // 6
					return sum_cubes - sum_squares


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

