




import math




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						Dict:

    """simple docstring"""


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

    __UpperCamelCase			=    3

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

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

    if n > 2:
        count += 1
    return count


if __name__ == "__main__":
 a_ 		=  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"""






from typing import TYPE_CHECKING

from ...utils import _LazyModule


__lowerCAmelCase				      =   {'''tokenization_phobert''': ['''PhobertTokenizer''']}


if TYPE_CHECKING:
							from .tokenization_phobert import PhobertTokenizer

else:
							import sys

							__lowerCAmelCase				      =   _LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)