#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define N 100005
#define lson l,m,x<<1
#define rson m+1,r,x<<1|1
int  a[205][2000];
void dfs(int x,int y,int z)
{
    if(x == 1)
    {
        a[1][0] = 1;
        return ;
    } 
    if(x == 2)
    {
        a[2][0] = 2;
        return ;
    }
    int i = 0;
    int k = 0;
    for(i = 0;i <= 1999;i ++)
    {
    
         a[x][i]=a[x-1][i]+a[x-2][i]+k;
          k = a[x][i]/10;
          a[x][i]%=10;
         
    } 
    
}
int main()
{
        int n;
        memset(a,0,sizeof(a));
        for(int i = 1;i <= 200 ;i ++)
        {
            dfs(i,i-1,i-2);
            
        }
        while(scanf("%d",&n)!=EOF)
        {
            int flag = 0;
            for(int j = 1999;j>=0;j--)
            {
                if(a[n][j]!=0) flag = 1;
                if(flag) printf("%d",a[n][j]);
            }
            printf("\n");
        }
}