#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <stdlib.h>
#include <cmath>
const int N=500;
using namespace std;
char s[210][N]= {"0","1","2"};
void INIT()
{
    for(int k=3; k<=200; k++) {
        int jn=strlen(s[k-1]),jk=strlen(s[k-2]);
        jn=jn>jk?jn:jk;
        int p[N]= {0},i;
        for(i=0; i<100&&(s[k-1][i]||s[k-2][i]); i++) {
            if(s[k-1][i])
                p[i]+=s[k-1][i]-'0';
            if(s[k-2][i])
                p[i]+=s[k-2][i]-'0';
            if(p[i]>9)
                p[i+1]+=1;
            p[i]%=10;
        }
        if(p[i])
            jn++;
        for(int i=0; i<jn; i++)
            s[k][i]=p[i]+'0';
    }
    for(int i=1; i<=200; i++) {
        int len=strlen(s[i]);
        for(int j=0; j<len/2; j++) {
            char c=s[i][j];
            s[i][j]=s[i][len-j-1];
            s[i][len-j-1]=c;
        }
    }
}
int main()
{
    INIT();
    int n;
    while(~scanf("%d",&n)) {
        printf("%s\n",s[n]);
    }
    return 0;
}