






def 						a    (		lowerCamelCase_       ):






				'''simple docstring'''
				lowercase__     				=    1
				lowercase__     				=    2
				while i * i <= n:
								lowercase__     				=    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    (		):






				'''simple docstring'''
				lowercase__     				=    1
				lowercase__     				=    1

				while True:
								i += 1
								t_num += i

								if count_divisors(lowerCamelCase_       ) > 500:
												break

				return t_num


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












def 						a    (		lowerCamelCase_	,     lowerCamelCase_	,     lowerCamelCase_       ):






				'''simple docstring'''

				if exponent == 1:
								return base
				if exponent % 2 == 0:
								lowercase__     				=    _modexpt(lowerCamelCase_	,     exponent // 2	,     lowerCamelCase_       ) % modulo_value
								return (x * x) % modulo_value
				else:
								return (base * _modexpt(lowerCamelCase_	,     exponent - 1	,     lowerCamelCase_       )) % modulo_value






def 						a    (		lowerCamelCase_ = 1777	,     lowerCamelCase_ = 1855	,     lowerCamelCase_ = 8       ):






				'''simple docstring'''
				lowercase__     				=    base
				for _ in range(1	,     lowerCamelCase_       ):
								lowercase__     				=    _modexpt(lowerCamelCase_	,     lowerCamelCase_	,     10**digits       )

				return result


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




