

import random


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





    """simple docstring"""


    SCREAMING_SNAKE_CASE_							,			SCREAMING_SNAKE_CASE_							,			SCREAMING_SNAKE_CASE_									=						[], [], []
    for element in data:
        if element < pivot:
            less.append(_SCREAMING_SNAKE_CASE       )
        elif element > pivot:
            greater.append(_SCREAMING_SNAKE_CASE       )
        else:
            equal.append(_SCREAMING_SNAKE_CASE       )
    return less, equal, greater





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





    """simple docstring"""


    if index >= len(_SCREAMING_SNAKE_CASE       ) or index < 0:
        return None

    SCREAMING_SNAKE_CASE_									=						items[random.randint(0 ,   len(_SCREAMING_SNAKE_CASE       ) - 1       )]
    SCREAMING_SNAKE_CASE_									=						0
    SCREAMING_SNAKE_CASE_							,			SCREAMING_SNAKE_CASE_							,			SCREAMING_SNAKE_CASE_									=						_partition(_SCREAMING_SNAKE_CASE ,   _SCREAMING_SNAKE_CASE       )
    SCREAMING_SNAKE_CASE_									=						len(_SCREAMING_SNAKE_CASE       )
    SCREAMING_SNAKE_CASE_									=						len(_SCREAMING_SNAKE_CASE       )

    # index is the pivot
    if m <= index < m + count:
        return pivot
    # must be in smaller
    elif m > index:
        return quick_select(_SCREAMING_SNAKE_CASE ,   _SCREAMING_SNAKE_CASE       )
    # must be in larger
    else:
        return quick_select(_SCREAMING_SNAKE_CASE ,   index - (m + count)       )





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


