



'''simple docstring'''







import math







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

		SCREAMING_SNAKE_CASE_						:str										=      3

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

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

		if n > 2:
				count += 1
		return count


if __name__ == "__main__":
							SCREAMING_SNAKE_CASE__     : int				=   51_24_21_83
							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}""")







from itertools import combinations_with_replacement







def    UpperCAmelCase				(  _lowerCamelCase   :	int = 100  ):





						'''simple docstring'''


						SCREAMING_SNAKE_CASE__  :					list[int] =       [*list(range(1      , 21  )  ), 25]
						SCREAMING_SNAKE_CASE__  :					list[int] =       [2 * x for x in range(1      , 21  )] + [50]
						SCREAMING_SNAKE_CASE__  :					list[int] =       [3 * x for x in range(1      , 21  )]
						SCREAMING_SNAKE_CASE__  :					list[int] =       singles + doubles + triples + [0]

						SCREAMING_SNAKE_CASE__  :					int =       0
						SCREAMING_SNAKE_CASE__  :					int
						SCREAMING_SNAKE_CASE__  :					int
						SCREAMING_SNAKE_CASE__  :					int
						SCREAMING_SNAKE_CASE__  :					int

						for double in doubles:
												for throwa, throwa in combinations_with_replacement(_lowerCamelCase      , 2  ):
																		SCREAMING_SNAKE_CASE__  :					int =       double + throwa + throwa
																		if checkout_total < limit:
																								num_checkouts += 1

						return num_checkouts


if __name__ == "__main__":
				print(f"{solution() = }")