




'''simple docstring'''

import math




def    snake_case__     (  a	)			->       Dict:





			'''simple docstring'''






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

			snake_case__          =						3

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

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

			if n > 2:
						count += 1
			return count


if __name__ == "__main__":
		a__         =     51_242_183
		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 				a__      (	_UpperCAmelCase						,  _UpperCAmelCase						,  _UpperCAmelCase						)     ->	float:

 '''simple docstring'''






 snake_case__     				=					[1 / first_term]
 snake_case__     				=					1 / first_term
 for _ in range(number_of_terms - 1						):
  first_term += common_difference
  arithmetic_progression.append(_UpperCAmelCase						)
 snake_case__     				=					[1 / step for step in arithmetic_progression]
 return sum(_UpperCAmelCase						)


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   print(sum_of_harmonic_progression(1 / 2, 2, 2))

