

import math





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

    SCREAMING_SNAKE_CASE__					     =						3

    while i <= int(math.sqrt(_A	)	):
        if n % i == 0:
            count += 1
            while n % i == 0:
                SCREAMING_SNAKE_CASE__					     =						int(n / i	)
        SCREAMING_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__        =			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}''')





from collections import namedtuple

A__        =			namedtuple("from_to", "from_ to")

A__        =			{
    "atm": from_to(1, 1),
    "pascal": from_to(0.0_000_098, 10_1325),
    "bar": from_to(0.986_923, 1.01_325),
    "kilopascal": from_to(0.00_986_923, 101.325),
    "megapascal": from_to(9.86_923, 0.101_325),
    "psi": from_to(0.068_046, 14.6_959),
    "inHg": from_to(0.0_334_211, 29.9_213),
    "torr": from_to(0.00_131_579, 760),
}





def 							__a       (					__A ,       __A ,       __A	):
    if from_type not in PRESSURE_CONVERSION:
        raise ValueError(
            f"Invalid 'from_type' value: {from_type!r}  Supported values are:\n"
            + ", ".join(__A	)	)
    if to_type not in PRESSURE_CONVERSION:
        raise ValueError(
            f"Invalid 'to_type' value: {to_type!r}.  Supported values are:\n"
            + ", ".join(__A	)	)
    return (
        value * PRESSURE_CONVERSION[from_type].from_ * PRESSURE_CONVERSION[to_type].to
    )


if __name__ == "__main__":
  import doctest

  doctest.testmod()


