# -*- coding: utf-8 -*-
# 標準入力を取得
n = int(input())

# 求解処理
# dp[i+1]: フィボナッチ数列の第i項
dp = [0 for _ in range(n + 1)]

# 初期条件
dp[0] = 1
dp[1] = 1

for i in range(1, n):
    # DP漸化式
    dp[i + 1] = dp[i] + dp[i - 1]
ans = dp[n]

# 結果出力
print(ans) n = int(input()) n int(input()) int input() input 0 for _ in range(n + 1) for _ in range(n + 1) _ range(n + 1) range n + 1 n 1 for _ in range(n + 1) 0 dp = [0 for _ in range(n + 1)] dp [0 for _ in range(n + 1)] dp[0] = 1 dp[0] dp 0 1 dp[1] = 1 dp[1] dp 1 1 for i in range(1, n):
    # DP漸化式
    dp[i + 1] = dp[i] + dp[i - 1] i range(1, n) range 1 n dp[i + 1] = dp[i] + dp[i - 1] dp[i + 1] dp i + 1 i 1 dp[i] + dp[i - 1] dp[i] dp i dp[i - 1] dp i - 1 i 1 ans = dp[n] ans dp[n] dp n print(ans) print ans ans = dp[n] dp[n] ans dp = [0 for _ in range(n + 1)] [0 for _ in range(n + 1)] dp n = int(input()) int(input()) n
# -*- coding: utf-8 -*-
# 標準入力を取得
n = int(input())

# 求解処理
# dp[i+1]: フィボナッチ数列の第i項
dp = [0 for _ in range(n + 1)]

# 初期条件
dp[0] = 1
dp[1] = 1

for i in range(1, n):
    # DP漸化式
    dp[i + 1] = dp[i] + dp[i - 1]
ans = dp[n]

# 結果出力
print(ans)
