
"""simple docstring"""





def 						_lowerCAmelCase				(				UpperCamelCase_				):
		__SCREAMING_SNAKE_CASE            = int(UpperCamelCase_				)
		if decimal in (0, 1):  # Exit cases for the recursion
				return str(UpperCamelCase_				)
		__SCREAMING_SNAKE_CASE       ,__SCREAMING_SNAKE_CASE            = divmod(UpperCamelCase_  ,				2				)
		return binary_recursive(UpperCamelCase_				) + str(UpperCamelCase_				)



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


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

							testmod()






"""simple docstring"""





def 						_lowerCAmelCase				(				UpperCamelCase_ = 100				):
		__SCREAMING_SNAKE_CASE            = 0
		__SCREAMING_SNAKE_CASE            = 0
		for i in range(1  ,				n + 1				):
				sum_of_squares += i**2
				sum_of_ints += i
		return sum_of_ints**2 - sum_of_squares


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




