
'''simple docstring'''

def 	A  (   UpperCamelCase_       :  str   )       ->							int:







			'''simple docstring'''



			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  (   )       ->							List[Any]:







			'''simple docstring'''



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













"""simple docstring"""





def   a    (     __UpperCAmelCase      :    int = 1_0_0  )    ->							int:
						__magic_name__:	str							=       0
						__magic_name__:	Any							=       0
						for i in range(1      ,   n + 1  ):
												sum_of_squares += i**2
												sum_of_ints += i
						return sum_of_ints**2 - sum_of_squares


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



