


class  lowerCamelCase__  :





     def __init__(self			)	->  None:
      _lowercase				 =[0, 1]





     def 	__A   (self						,	UpperCAmelCase			)	->  list:
      if (difference := index - (len(self.sequence			) - 2)) >= 1:
       for _ in range(UpperCAmelCase			):
        self.sequence.append(self.sequence[-1] + self.sequence[-2]			)
      return self.sequence[:index]



def 							UpperCAmelCase_   (				)	->     None:







 """simple docstring"""


 print(
     '''Fibonacci Series Using Dynamic Programming\n'''	,		'''Enter the index of the Fibonacci number you want to calculate '''	,		'''in the prompt below. (To exit enter exit or Ctrl-C)\n'''	,		sep=''''''	,		)
 _lowercase				 =Fibonacci()

 while True:
  _lowercase				 =input('''>> '''		)
  if prompt in {"exit", "quit"}:
   break

  try:
   _lowercase				 =int(__snake_case		)
  except ValueError:
   print('''Enter a number or \'exit\''''		)
   continue

  print(fibonacci.get(__snake_case		)		)


if __name__ == "__main__":
  main()





import math
def 							UpperCAmelCase_   (				__snake_case		)	->     int:







 """simple docstring"""


 return sum(int(__snake_case		) for digit in str(__snake_case		)		)
def 							UpperCAmelCase_   (				__snake_case = 30		)	->     int:







 """simple docstring"""


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

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


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

