#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;

int dp[210][200];

void init(){
    memset(dp,0,sizeof(dp));
    dp[1][0]=1;
    dp[2][0]=2;
    int i,j;
    int k;
    for(i=3; i<=200; ++i){
        k=0;
        for(j=0; j<200; ++j){
            if(dp[i-2][j]>0||dp[i-1][j]>0||k>0){
                dp[i][j] = dp[i-2][j]+dp[i-1][j]+k;
                k=dp[i][j]/10;
                dp[i][j] %= 10;
            }
        }
    }
}

int main(){
    int n;
    init();
    while(~scanf("%d", &n)){
        int i=200-1;
        while(dp[n][i]==0)--i;
        while(i>=0){
            printf("%d", dp[n][i]);
            i--;
        }
        printf("\n");
    }
    return 0;
}