#为啥不能递归啊？？？
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param n int整型 
# @return int整型
#
class Solution:
    def Fibonacci(self , n: int) -> int:
        # write code here
        if n ==1 or n == 2:
            return 1
        else:
            dp = [0 for _ in range(n + 1)]
            dp[1] = 1
            dp[2] = 1
            for i in range(3, n + 1):
                dp[i] = dp[i-1] + dp[i-2]
            return dp[n]