



"""simple docstring"""
import math
def   A_    (     _lowercase      ):







						'''simple docstring'''


						snake_case_					:int		=     0
						if n % 2 == 0:
												count += 1
												while n % 2 == 0:
																		snake_case_					:Union[str, Any]		=     int(n / 2      )
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

						snake_case_					:Dict		=     3

						while i <= int(math.sqrt(_lowercase      )      ):
												if n % i == 0:
																		count += 1
																		while n % i == 0:
																								snake_case_					:List[str]		=     int(n / i      )
												snake_case_					:Optional[int]		=     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_24_21_83
						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 os
def   A_    (     ):







						'''simple docstring'''


						snake_case_					:Optional[Any]		=     os.path.dirname(os.path.realpath(_lowercase      )      )
						snake_case_					:int		=     os.path.join(_lowercase,   """triangle.txt"""      )

						with open(_lowercase      ) as in_file:
												snake_case_					:List[Any]		=     [[int(_lowercase      ) for i in line.split()] for line in in_file]

						while len(_lowercase      ) != 1:
												snake_case_					:str		=     triangle.pop()
												snake_case_					:int		=     triangle[-1]
												for j in range(len(_lowercase      ) - 1      ):
																		curr_row[j] += max(last_row[j],   last_row[j + 1]      )
						return triangle[0][0]


if __name__ == "__main__":
						print(solution())
