code: import math
  
  
  def 					__lowerCAmelCase			(  _A					):
  
  
  
  							"""simple docstring"""
  
  
  							_lowercase				=	0
  							if n % 2 == 0:
  														count += 1
  														while n % 2 == 0:
  																					_lowercase				=	int(n / 2					)
      # the n input value must be odd so that
      # we can skip one element (ie i += 2)
  
  							_lowercase				=	3
  
  							while i <= int(math.sqrt(_A					)					):
  														if n % i == 0:
  																					count += 1
  																					while n % i == 0:
  																												_lowercase				=	int(n / i					)
  														_lowercase				=	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]        =			5124_2183
  				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}''')
  
  
  
style_context: def 					__lowerCAmelCase			(  _A					):
  
  
  
  							"""simple docstring"""
  
  
  							if len(_A					) <= 1:
  														return data
  							else:
  														return [
  														    *quick_sort([e for e in data[1:] if e <= data[0]]					),
  														    data[0],
  														    *quick_sort([e for e in data[1:] if e > data[0]]					),
  														]
  
  
  if __name__ == "__main__":
  				import doctest
  
  				doctest.testmod()
  
  
  