

def 					_UpperCAmelCase       (  _SCREAMING_SNAKE_CASE					:		int = 100       ):





    """simple docstring"""


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


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





def 					_UpperCAmelCase       (  ):





    """simple docstring"""


    for n in range(1 ,   1_000_000       ):
        yield n * (n + 1) // 2


def 					_UpperCAmelCase       (  _SCREAMING_SNAKE_CASE					:		Tuple       ):





    """simple docstring"""


    SCREAMING_SNAKE_CASE_									=						1
    SCREAMING_SNAKE_CASE_									=						2
    while i * i <= n:
        SCREAMING_SNAKE_CASE_									=						0
        while n % i == 0:
            n //= i
            multiplicity += 1
        divisors_count *= multiplicity + 1
        i += 1
    if n > 1:
        divisors_count *= 2
    return divisors_count


def 					_UpperCAmelCase       (  ):





    """simple docstring"""


    return next(i for i in triangle_number_generator() if count_divisors(_SCREAMING_SNAKE_CASE       ) > 500       )


if __name__ == "__main__":
       print(solution())


