

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())





def 					_UpperCAmelCase       (  _SCREAMING_SNAKE_CASE					:		list ,   _SCREAMING_SNAKE_CASE					:		list ,   _SCREAMING_SNAKE_CASE					:		int ,   _SCREAMING_SNAKE_CASE					:		int ,   _SCREAMING_SNAKE_CASE					:		int       ):





    """simple docstring"""


    if index == number_of_items:
        return 0
    SCREAMING_SNAKE_CASE_									=						0
    SCREAMING_SNAKE_CASE_									=						0
    SCREAMING_SNAKE_CASE_									=						knapsack(_SCREAMING_SNAKE_CASE ,   _SCREAMING_SNAKE_CASE ,   _SCREAMING_SNAKE_CASE ,   _SCREAMING_SNAKE_CASE ,   index + 1       )
    if weights[index] <= max_weight:
        SCREAMING_SNAKE_CASE_									=						values[index] + knapsack(
            _SCREAMING_SNAKE_CASE ,   _SCREAMING_SNAKE_CASE ,   _SCREAMING_SNAKE_CASE ,   max_weight - weights[index] ,   index + 1       )
    return max(_SCREAMING_SNAKE_CASE ,   _SCREAMING_SNAKE_CASE       )


if __name__ == "__main__":
       import doctest

       doctest.testmod()


