'''simple docstring'''
from math import gcd







def 				__UpperCamelCase (					__UpperCAmelCase  :					int = 12_000			)							->	int:
  lowercase				:							Dict									=   0
  for d in range(max_d + 1			):
    for n in range(d // 3 + 1 ,   (d + 1) // 2			):
      if gcd(__UpperCAmelCase ,   __UpperCAmelCase			) == 1:
        fractions_number += 1
  return fractions_number


if __name__ == "__main__":
 print(f"""{solution() = }""")
'''simple docstring'''
import math







def 				__UpperCamelCase (					__UpperCAmelCase  :					str			)							->	Optional[int]:
  lowercase				:							Tuple									=   0
  if n % 2 == 0:
    count += 1
    while n % 2 == 0:
      lowercase				:							Optional[int]									=   int(n / 2			)
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

  lowercase				:							Dict									=   3

  while i <= int(math.sqrt(__UpperCAmelCase			)			):
    if n % i == 0:
      count += 1
      while n % i == 0:
        lowercase				:							Dict									=   int(n / i			)
    lowercase				:							List[Any]									=   i + 2

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

  if n > 2:
    count += 1
  return count


if __name__ == "__main__":
 _A		:      List[Any]						   =5_1_2_4_2_1_8_3
 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}""")