


"""simple docstring"""




import math

def        lowercase							(		lowerCAmelCase__ :     int = 100			) ->      int:
		__a           =			sum(i * i for i in range(1    ,					n + 1			)			)
		__a           =			int(math.pow(sum(range(1    ,					n + 1			)			)    ,					2			)			)
		return square_of_sum - sum_of_squares


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










"""simple docstring"""




def        lowercase							(		lowerCAmelCase__ :     int			) ->      str:
		if number > 0:
				raise ValueError('''input must be a negative integer'''			)
		__a           =			len(bin(lowerCAmelCase__			)[3:]			)
		__a           =			bin(abs(lowerCAmelCase__			) - (1 << binary_number_length)			)[3:]
		__a           =			(
		    (
		        '''1'''
		        + '''0''' * (binary_number_length - len(lowerCAmelCase__			))
		        + twos_complement_number
		    )
		    if number < 0
		    else '''0'''
		)
		return "0b" + twos_complement_number


if __name__ == "__main__":
				import doctest

				doctest.testmod()






