Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: meme_boi2
Problemset: Fibonacci Croissant
Language: python
Time: 0.014 second
Submitted On: 2025-09-02 22:35:52
n = int(input())
dp = [1,1]
i = 2
ans = 2
for i in range(2,n,1):
dp.append(dp[i-1] + dp[i-2])
ans += dp[i]
print(ans)