




'''simple docstring'''







from math import loga





def 		snake_case_							(_a			:							int  ):
    if a < 0:
        raise ValueError('''Input value must be a positive integer'''  )
    elif isinstance(_a					,     _a  ):
        raise TypeError('''Input value must be a \'int\' type'''  )
    return 0 if (a == 0) else int(loga(a & -a  )  )


if __name__ == "__main__":
   import doctest

   doctest.testmod()










'''simple docstring'''







def 		snake_case_							():
    for n in range(1					,     1_0_0_0_0_0_0  ):
        yield n * (n + 1) // 2





def 		snake_case_							(_a			:							Union[str, Any]  ):
    UpperCAmelCase     =	1
    UpperCAmelCase     =	2
    while i * i <= n:
        UpperCAmelCase     =	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 		snake_case_							():
    return next(i for i in triangle_number_generator() if count_divisors(_a  ) > 5_0_0  )


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




