def       _snake_case	(   lowerCAmelCase							:   int = 1_0_0	):
		"""simple docstring"""







		SCREAMING_SNAKE_CASE_  :		Optional[int]				      =    n * (n + 1) * (2 * n + 1) / 6
		SCREAMING_SNAKE_CASE_  :		int				      =    (n * (n + 1) / 2) ** 2
		return int(square_of_sum - sum_of_squares	)


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

def       _snake_case	(   lowerCAmelCase							:   int	):
		"""simple docstring"""







		SCREAMING_SNAKE_CASE_  :		Tuple				      =    int(lowerCAmelCase	)
		if decimal in (0, 1):  # Exit cases for the recursion
				return str(lowerCAmelCase	)
		SCREAMING_SNAKE_CASE_      ,    SCREAMING_SNAKE_CASE_  :		Dict				      =    divmod(lowerCAmelCase   , 2	)
		return binary_recursive(lowerCAmelCase	) + str(lowerCAmelCase	)




def       _snake_case	(   lowerCAmelCase							:   str	):
		"""simple docstring"""







		SCREAMING_SNAKE_CASE_  :		str				      =    str(lowerCAmelCase	).strip()
		if not number:
				raise ValueError("No input value was provided"	)
		SCREAMING_SNAKE_CASE_  :		List[str]				      =    "-" if number.startswith("-"	) else ""
		SCREAMING_SNAKE_CASE_  :		Optional[Any]				      =    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()
