

'''simple docstring'''




import math


def       lowerCamelCase__		(						SCREAMING_SNAKE_CASE      :   Tuple						):
  UpperCAmelCase													=	0
  if n % 2 == 0:
    count += 1
    while n % 2 == 0:
      UpperCAmelCase													=	int(n / 2						)
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

  UpperCAmelCase													=	3

  while i <= int(math.sqrt(_A						)						):
    if n % i == 0:
      count += 1
      while n % i == 0:
        UpperCAmelCase													=	int(n / i						)
    UpperCAmelCase													=	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] 							=						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'''




_a				: Tuple 							=						'\n# Diffusers installation\n! pip install diffusers transformers datasets accelerate\n# To install from source instead of the last release, comment the command above and uncomment the following one.\n# ! pip install git+https://github.com/huggingface/diffusers.git\n'

_a				: Tuple 							=						[{'type': 'code', 'content': INSTALL_CONTENT}]


