#include<map>
#include<set>
#include<cmath>
#include<stack>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define pi acos(-1)
#define eps 1e-13
#define mod 9973
#define inf 1000000000
#define ll long long
using namespace std;
ll read()
{
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int N;
struct data{
    int v[205];
    int len;
    data(){
        memset(v,0,sizeof(v));
        len=1;
    }
    friend data operator+(data a,data b){
        data c;
        c.len=max(a.len,b.len);
        for(int i=1;i<=c.len;i++)
        {
            c.v[i]+=a.v[i]+b.v[i];
            if(c.v[i]>=10)
                c.v[i]%=10,c.v[i+1]++;
        }
        if(c.v[c.len+1])c.len++;
        return c;
    }
}F[205];
void print(data a)
{
    for(int i=a.len;i;i--)
        printf("%d",a.v[i]);
    puts("");
}
int main()
{
    F[0].v[1]=F[1].v[1]=1;
    for(int i=2;i<=200;i++)
        F[i]=F[i-1]+F[i-2];
    while(scanf("%d",&N)!=EOF)
        print(F[N]);
    return 0;
}