






import math

def 						snake_case      (UpperCAmelCase__						) ->       Union[str, Any]:
  UpperCamelCase_:      Any					   =       0
  if n % 2 == 0:
    count += 1
    while n % 2 == 0:
      UpperCamelCase_:      Dict					   =       int(n / 2						)
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

  UpperCamelCase_:      Optional[Any]					   =       3

  while i <= int(math.sqrt(_A						)						):
    if n % i == 0:
      count += 1
      while n % i == 0:
        UpperCamelCase_:      Optional[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__":
   A_	:	Optional[Any]				=				51242183
   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}''')







from math import factorial

def 						snake_case      (UpperCAmelCase__			,					UpperCAmelCase__						) ->       Dict:
  return factorial(UpperCAmelCase__						) / (factorial(UpperCAmelCase__						) * factorial(n - r						))

def 						snake_case      () ->       Optional[Any]:
  UpperCamelCase_:      int					   =       0

  for i in range(1			,					1_0_1						):
    for j in range(1			,					i + 1						):
      if combinations(UpperCAmelCase__			,					UpperCAmelCase__						) > 1E6:
        total += 1
  return total


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