#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>

using namespace std;

const int maxn=210;

struct gjd {
    static const int maxl=1000;
    int a[maxl];int len;
    gjd(int x=0) {
        int i=0;
        memset(a,0,sizeof(a));
        while (x) {
            a[i++]=x%10;
            x/=10;
        }
        len=i+1;
    }
    gjd operator+(const gjd &rhs)const {
        gjd ans;
        int x=0;
        for (int i=0;i<len;++i) {
            ans.a[i]=a[i]+rhs.a[i]+x;
            x=ans.a[i]/10;
            ans.a[i]%=10;
        }
        ans.len=max(len,rhs.len)+1;
        return ans;
    }
    void writeln()const {
        for (int i=maxl-1;i>=0;--i) {
            if (a[i]||i==0) {
                for (;i>=0;--i)printf("%d",a[i]);
                printf("\n");
                return;
            }
        }
    }
};
gjd ans[maxn];

int main() {
    int n;
    ans[0]=ans[1]=1;
    for(int i=2;i<maxn;++i){
        ans[i]=ans[i-1]+ans[i-2];
    }
    while(scanf("%d",&n)==1){
        if(n==0){
            printf("\n"); //fucking!
        }else{
            ans[n].writeln();
        }
    }
    return 0;
}