



'''simple docstring'''

import math






def 		_snake_case		(					_SCREAMING_SNAKE_CASE     :						Optional[int]							)			->						Union[str, Any]:







	"""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(_SCREAMING_SNAKE_CASE							)							):
		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			=    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'''

def 		_snake_case		(					_SCREAMING_SNAKE_CASE     :						int = 4_000_000							)			->						int:







	"""simple docstring"""
	lowerCAmelCase    =	1
	lowerCAmelCase    =	2
	lowerCAmelCase    =	0
	while j <= n:
		if j % 2 == 0:
			total += j
		lowerCAmelCase,   lowerCAmelCase    =	j, i + j

	return total


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