




'''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'''

import unittest
import warnings

from datasets.utils import experimental




@experimental
def    snake_case__     (  )			->       Union[str, Any]:





			'''simple docstring'''






			return "success"





class __magic_name__(						unittest.TestCase      ):






						def       __lowerCAmelCase(   self						:						List[Any]       ):



									'''simple docstring'''






									with warnings.catch_warnings(record=__UpperCamelCase       ) as w:
												warnings.simplefilter("""always"""       )
												self.assertEqual(dummy_function()					,   """success"""       )
									self.assertEqual(len(__UpperCamelCase       )					,   1       )