



def 	SCREAMING_SNAKE_CASE_							(	_snake_case	:List[Any]				)  ->     Tuple:
   _A      =       1
   _A      =       2
   while i * i <= n:
      _A      =       0
      while n % i == 0:
         n //= i
         multiplicity += 1
      n_divisors *= multiplicity + 1
      i += 1
   if n > 1:
      n_divisors *= 2
   return n_divisors

def 	SCREAMING_SNAKE_CASE_							(	)  ->     Optional[Any]:
   _A      =       1
   _A      =       1

   while True:
      i += 1
      t_num += i

      if count_divisors(_snake_case				) > 500:
         break

   return t_num


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








import itertools
import math

def 	SCREAMING_SNAKE_CASE_							(	_snake_case	:int				)  ->     bool:

   if 1 < number < 4:
      # 2 and 3 are primes
      return True
   elif number < 2 or number % 2 == 0 or number % 3 == 0:
      # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
      return False

   # All primes number are in format of 6k +/- 1
   for i in range(5	,   int(math.sqrt(_snake_case				) + 1				)	,   6				):
      if number % i == 0 or number % (i + 2) == 0:
         return False
   return True

def 	SCREAMING_SNAKE_CASE_							(	)  ->     Dict:
   _A      =       2
   while True:
      if is_prime(_snake_case				):
         yield num
      num += 1

def 	SCREAMING_SNAKE_CASE_							(	_snake_case	:int = 10_001				)  ->     int:
   return next(itertools.islice(prime_generator()	,   nth - 1	,   _snake_case				)				)


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



