



def 		a__      (		_UpperCamelCase      :			int				):
   __lowerCamelCase    				=     1
   __lowerCamelCase    				=     2
   while i * i <= n:
      __lowerCamelCase    				=     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 		a__      (		):
   __lowerCamelCase    				=     1
   __lowerCamelCase    				=     1

   while True:
      i += 1
      t_num += i

      if count_divisors(_UpperCamelCase				) > 5_00:
         break

   return t_num


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











from __future__ import annotations





def 		a__      (		_UpperCamelCase      :			list[float]				):
   if len(_UpperCamelCase				) < 2:
      raise ValueError('''Monogons and Digons are not polygons in the Euclidean space'''				)
   if any(i <= 0 for i in nums				):
      raise ValueError('''All values must be greater than 0'''				)
   __lowerCamelCase    				=     nums.copy()
   copy_nums.sort()
   return copy_nums[-1] < sum(copy_nums[:-1]				)


if __name__ == "__main__":
  import doctest

  doctest.testmod()






