n = int(input())

占位

dp = [1,1] def qw_tj(n): if n==1 or n==2: print(1) return 1 for i in range(2,n): dp.append( dp[i-2] + dp[i-1]) print(dp[n-1]) qw_tj(n+1)