
import math


def 		_lowerCamelCase       (   _a  ):
  """simple docstring"""




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

  _lowerCamelCase      =						3

  while i <= int(math.sqrt(UpperCAmelCase_  )  ):
    if n % i == 0:
      count += 1
      while n % i == 0:
        _lowerCamelCase      =						int(n / i  )
    _lowerCamelCase      =						i + 2

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

  if n > 2:
    count += 1
  return count


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









'''simple docstring'''







def 			_lowerCAmelCase(      UpperCAmelCase_      :	list					, UpperCAmelCase_      :	int					, UpperCAmelCase_      :	int					, UpperCAmelCase_      :	int						) ->							int:
							lowerCAmelCase__  =   int((lower_bound + upper_bound) // 2						)
							if array[r] == value:
														return r
							if lower_bound >= upper_bound:
														return -1
							if array[r] < value:
														return binary_search(UpperCAmelCase_					, r + 1					, UpperCAmelCase_					, UpperCAmelCase_						)
							else:
														return binary_search(UpperCAmelCase_					, UpperCAmelCase_					, r - 1					, UpperCAmelCase_						)
def 			_lowerCAmelCase(      UpperCAmelCase_      :	int					, UpperCAmelCase_      :	list						) ->							list:
							lowerCAmelCase__  =   0
							if matrix[index][0] == value:
														return [index, 0]
							while index < len(UpperCAmelCase_						) and matrix[index][0] < value:
														lowerCAmelCase__  =   binary_search(matrix[index]					, 0					, len(matrix[index]						) - 1					, UpperCAmelCase_						)
														if r != -1:
																					return [index, r]
														index += 1
							return [-1, -1]


if __name__ == "__main__":
		import doctest

		doctest.testmod()





