#include"cstdio"
#include"queue"
#include"cmath"
#include"stack"
#include"iostream"
#include"algorithm"
#include"cstring"
#include"queue"
#include"map"
#include"set"
#include"vector"
#define LL long long
#define ull unsigned long long
#define mems(a,b) memset(a,b,sizeof(a))
#define ls pos<<1
#define rs pos<<1|1
using namespace std;

const int N = 205;
const int MOD = 9973;
const int INF = 0x3f3f3f3f;
vector<int> dp[N];

void add(int i,int j){
    int li=dp[i].size();
    int lj=dp[j].size();
    int p=0,c=0;
    while(p<li){
        //cout<<p<<' '<<li<<endl;
        if(p>=lj){
            int tmp=dp[i][p]+c;
            dp[i][p]=tmp%10;
            c=tmp/10;
            p++;
            continue;
        }
        int tmp=dp[i][p]+dp[j][p]+c;
        c=tmp/10;
        dp[i][p]=tmp%10;
        p++;
    }
    if(c) dp[i].push_back(1);
}

int main(){
    for(int i=0;i<N;i++) dp[i].clear();
    dp[1].push_back(1);
    dp[2].push_back(2);

    for(int i=3;i<N;i++){
        int k=dp[i-1].size();
        for(int j=0;j<k;j++) dp[i].push_back(dp[i-1][j]);
        add(i,i-2);
    }
    int n;
    while(~scanf("%d",&n)){
        int len=dp[n].size();
        for(int i=len-1;i>=0;i--) cout<<dp[n][i];
        cout<<endl;
    }
    return 0;
}