
'''simple docstring'''





import math





def 							snake_case				(		UpperCAmelCase						)->      Dict:







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

      __A													=      3

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

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

      if n > 2:
            count += 1
      return count


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











'''simple docstring'''







def  SCREAMING_SNAKE_CASE__ (				SCREAMING_SNAKE_CASE     ):
		for i, _ in enumerate(SCREAMING_SNAKE_CASE     ):
				if (i % 2 == 1) == (nums[i - 1] > nums[i]):
						SCREAMING_SNAKE_CASE_						,		SCREAMING_SNAKE_CASE_						:Dict										=      nums[i], nums[i - 1]

		return nums


if __name__ == "__main__":
							print("""Enter the array elements:""")
							SCREAMING_SNAKE_CASE__     : Tuple				=   list(map(int, input().split()))
							print("""The unsorted array is:""")
							print(array)
							print("""Array after Wiggle sort:""")
							print(wiggle_sort(array))
