






lowerCamelCase_						     =  [0.485, 0.456, 0.406]
lowerCamelCase_						     =  [0.229, 0.224, 0.225]
lowerCamelCase_						     =  [0.5, 0.5, 0.5]
lowerCamelCase_						     =  [0.5, 0.5, 0.5]
lowerCamelCase_						     =  [0.48145466, 0.4578275, 0.40821073]
lowerCamelCase_						     =  [0.26862954, 0.26130258, 0.27577711]











import math
def      lowerCamelCase					(						a_	)	->			Dict:
							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(a_	)	):
														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__":
		lowerCamelCase_						     =  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}''')



