





"""simple docstring"""


import math

def      UpperCamelCase							(SCREAMING_SNAKE_CASE = 100     ):
						UpperCamelCase				:		Union[str, Any]				   =			sum(i * i for i in range(1							,     n + 1     )     )
						UpperCamelCase				:		int				   =			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 			_UpperCamelCase						(    _A   )     ->	int:





    """simple docstring"""

    if not isinstance(_A       ,   _A   ) or number < 0:
        raise ValueError("""Input must be a non-negative integer"""   )

    _UpperCAmelCase        = 0
    while number:
        # This way we arrive at next set bit (next 1) instead of looping
        # through each bit and checking for 1s hence the
        # loop won't run 32 times it will only run the number of `1` times
        number &= number - 1
        count += 1
    return count


if __name__ == "__main__":
 import doctest

 doctest.testmod()