#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#define ll   long long
#define pb   push_back
#define mp   make_pair
#define orz  1000000007
//作者:中国江苏南京丁天行
//from CrAzYUnIoN
//I prefer being hacked than being FST
using namespace std;
int l[205],n,a[205][205];
int main()
{
    l[1]=1,l[2]=1,l[3]=1,l[4]=1,l[5]=1;
    a[1][1]=1,a[2][1]=2,a[3][1]=3,a[4][1]=5,a[5][1]=8;
    for(int i=6;i<=200;i++){
            for(int j=1;j<=l[i-1];j++)a[i][j]=a[i-1][j]+a[i-2][j];
            for(int j=1;j<=l[i-1];j++)a[i][j+1]+=a[i][j]/10,a[i][j]%=10;
            l[i]=a[i][l[i-1]+1]?l[i-1]+1:l[i-1];
    }
    while(scanf("%d",&n)==1){
                             for(int i=l[n];i;i--)printf("%d",a[n][i]);
                             printf("\n");
    }
    //system("pause");
    return 0;
}