



def 					lowercase				(      SCREAMING_SNAKE_CASE__				:		str )     ->   str:
 _snake_case			:     int 		=    1
 _snake_case			:     Dict 		=    2
 while i * i <= n:
  _snake_case			:     Union[str, Any] 		=    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 					lowercase				(      )     ->   List[str]:
 _snake_case			:     Tuple 		=    1
 _snake_case			:     Dict 		=    1

 while True:
  i += 1
  t_num += i

  if count_divisors(__A ) > 500:
   break

 return t_num


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


'''simple docstring'''







from collections import defaultdict
from math import gcd







def 				SCREAMING_SNAKE_CASE__	(   __A = 1_500_000	)       ->	int:
	_snake_case   						=		defaultdict(__A	)
	_snake_case   						=		2
	while 2 * euclid_m * (euclid_m + 1) <= limit:
		for euclid_n in range((euclid_m % 2) + 1			,				__A			,				2	):
			if gcd(__A			,				__A	) > 1:
				continue
			_snake_case   						=		2 * euclid_m * (euclid_m + euclid_n)
			for perimeter in range(__A			,				limit + 1			,				__A	):
				frequencies[perimeter] += 1
		euclid_m += 1
	return sum(1 for frequency in frequencies.values() if frequency == 1	)


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

