






"""simple docstring"""


import math




def      snake_case    (A_ :List[Any] ):







  '''simple docstring'''

  a	:     Dict							=  0
  if n % 2 == 0:
    count += 1
    while n % 2 == 0:
      a	:     List[str]							=  int(n / 2 )
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

  a	:     Optional[int]							=  3

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

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

  if n > 2:
    count += 1
  return count


if __name__ == "__main__":
   _UpperCamelCase							:       Tuple       					=		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}''')












"""simple docstring"""


from __future__ import annotations




def      snake_case    (A_ :int ):







  '''simple docstring'''

  assert (
      isinstance(A_      ,     A_ ) and mask > 0
  ), f'''mask needs to be positive integer, your input {mask}'''
  a	:     Any							=  []
  a	:     Union[str, Any]							=  mask

  while submask:
    all_submasks.append(A_ )
    a	:     Any							=  (submask - 1) & mask

  return all_submasks


if __name__ == "__main__":
   import doctest

   doctest.testmod()




