




import math





def 							lowerCamelCase    (							UpperCAmelCase_	:      int      )->			int:

       """simple docstring"""




       return sum(int(UpperCAmelCase_      ) for digit in str(UpperCAmelCase_      )      )





def 							lowerCamelCase    (							UpperCAmelCase_	:      int = 30      )->			int:

       """simple docstring"""




       a			   =[]
       for digit in range(2   ,       100      ):
              for power in range(2   ,       100      ):
                     a			   =int(math.pow(UpperCAmelCase_   ,       UpperCAmelCase_      )      )
                     if digit == digit_sum(UpperCAmelCase_      ):
                            digit_to_powers.append(UpperCAmelCase_      )

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


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






from __future__ import annotations





def 							lowerCamelCase    (							UpperCAmelCase_	:      list[int | float]      )->			int | float:

       """simple docstring"""




       if len(UpperCAmelCase_      ) == 0:
              raise ValueError("""find_min() arg is an empty sequence"""      )
       a			   =nums[0]
       for num in nums:
              a			   =min(UpperCAmelCase_   ,       UpperCAmelCase_      )
       return min_num


if __name__ == "__main__":
    import doctest

    doctest.testmod(verbose=True)
