





from math import exp


def        __SCREAMING_SNAKE_CASE	(				__lowercase:		Optional[int]):



  '''simple docstring'''






  return 8 * x - 2 * exp(-x)


def        __SCREAMING_SNAKE_CASE	(				__lowercase:		Any  ,				__lowercase:		Tuple  ,				__lowercase:		str):



  '''simple docstring'''






  __lowerCAmelCase								=					lower_bound
  __lowerCAmelCase								=					upper_bound
  for _ in range(0  ,				lowerCAmelCase_):
    __lowerCAmelCase								=					xa, xa - (f(lowerCAmelCase_) * (xa - xa)) / (f(lowerCAmelCase_) - f(lowerCAmelCase_))
  return xa


if __name__ == "__main__":
      print(f"""Example: {secant_method(1, 3, 2)}""")

import math







def 						UpperCAmelCase							(		lowerCAmelCase_							)						->						int:
     return sum(int(lowerCAmelCase_							) for digit in str(lowerCAmelCase_							)							)







def 						UpperCAmelCase							(		lowerCAmelCase_ = 3_0							)						->						int:
     a	:     Optional[int]						      =    []
     for digit in range(2    ,   1_0_0							):
          for power in range(2    ,   1_0_0							):
               a	:     List[str]						      =    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())