
"""simple docstring"""





import math







def       __a	(						__lowerCamelCase    ):
   return sum(int(__lowerCamelCase    ) for digit in str(__lowerCamelCase    )    )







def       __a	(						__lowerCamelCase = 30    ):
   UpperCAmelCase_   :   Tuple     	=       []
   for digit in range(2,						100    ):
      for power in range(2,						100    ):
         UpperCAmelCase_   :   Optional[Any]     	=       int(math.pow(__lowerCamelCase,						__lowerCamelCase    )    )
         if digit == digit_sum(__lowerCamelCase    ):
            digit_to_powers.append(__lowerCamelCase    )

   digit_to_powers.sort()
   return digit_to_powers[n - 1]


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








"""simple docstring"""
import math






def 				__lowerCAmelCase					(					__lowerCAmelCase			:		Tuple						)    ->       Any:
 _UpperCamelCase      :	str					      =  0
 if n % 2 == 0:
  count += 1
  while n % 2 == 0:
   _UpperCamelCase      :	List[Any]					      =  int(n / 2						)
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

 _UpperCamelCase      :	Tuple					      =  3

 while i <= int(math.sqrt(__lowerCAmelCase						)						):
  if n % i == 0:
   count += 1
   while n % i == 0:
    _UpperCamelCase      :	Any					      =  int(n / i						)
  _UpperCamelCase      :	Optional[Any]					      =  i + 2

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

 if n > 2:
  count += 1
 return count


if __name__ == "__main__":
    _SCREAMING_SNAKE_CASE						 =     5_1_2_4_2_1_8_3
    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}')



