





"""simple docstring"""




import math





def 			a_							(				_lowercase  ):
						_UpperCamelCase     :   int      =       0
						if n % 2 == 0:
												count += 1
												while n % 2 == 0:
																		_UpperCamelCase     :   Optional[Any]      =       int(n / 2  )
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

						_UpperCamelCase     :   List[str]      =       3

						while i <= int(math.sqrt(_lowercase  )  ):
												if n % i == 0:
																		count += 1
																		while n % i == 0:
																								_UpperCamelCase     :   Any      =       int(n / i  )
												_UpperCamelCase     :   str      =       i + 2

						# this condition checks the prime
						# number n is greater than 2

						if n > 2:
												count += 1
						return count


if __name__ == "__main__":
						UpperCamelCase_	 =51_242_183
						print(F"The number of distinct prime factors is/are {exact_prime_factor_count(n)}")
						print(F"The value of log(log(n)) is {math.log(math.log(n)):.4f}")







"""simple docstring"""







def 	lowercase     (							A_ = 100    ,  A_ = 100			)-> int:
  '''simple docstring'''







  return max(
      sum(int(A_			) for x in str(base**power			)			)
      for base in range(A_			)
      for power in range(A_			)			)


# Tests
if __name__ == "__main__":
 import doctest

 doctest.testmod()






