#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<set>
#include<map>
using namespace std;
const int MAXN=1e5+100,mod=9973,esp=1e-6,inf=0x3f3f3f3f;
typedef long long ll;
const ll INF = (1ll<<60);
int ans[210][100];
int main()
{
    int i,j,t;
    ans[0][0]=1;
    ans[1][0]=1;
    for(i=2; i<=210; i++)
    {
        for(j=0; j<100; j++)
        {
            ans[i][j]+=ans[i-1][j]+ans[i-2][j];
            if(ans[i][j]>=10)
            {
                ans[i][j]-=10;
                ans[i][j+1]=1;
            }
        }
    }
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        for(j=100-1; j>=0; j--) if(ans[n][j]) break;
        if(j<0) printf("0");
        for(i=j; i>=0; i--) printf("%d",ans[n][i]);
        cout<<endl;
    }
    return 0;
}