


import math






def 					a__ (       _UpperCamelCase ):





						"""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(_UpperCamelCase ) ):
												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			 =   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"""







from collections import defaultdict






def 					a__ (       _UpperCamelCase = 5 ):





						"""simple docstring"""

						UpperCAmelCase__		=    defaultdict(_UpperCamelCase )
						UpperCAmelCase__		=    0

						while True:
												UpperCAmelCase__		=    get_digits(_UpperCamelCase )
												freqs[digits].append(_UpperCamelCase )

												if len(freqs[digits] ) == max_base:
																		UpperCAmelCase__		=    freqs[digits][0] ** 3
																		return base

												num += 1






def 					a__ (       _UpperCamelCase ):





						"""simple docstring"""

						return "".join(sorted(str(num**3 ) ) )


if __name__ == "__main__":
						print(f'''{solution() = }''')