#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
struct BigInteger{
    static const int BASE = 1e8;
    static const int WIDTH = 8;
    vector<int> s;
    BigInteger(long long num=0){
        *this = num;
    }
    BigInteger operator=(long long num){
        s.clear();
        do{
            s.push_back(num%BASE);
            num/=BASE;
        }while(num>0);
        return *this;
    }
    BigInteger operator+(const BigInteger& b)const{
        BigInteger c;
        c.s.clear();
        for(int i=0,g=0;;i++){
            if(g==0&&i>=s.size()&&i>=b.s.size())break;
            int x = g;
            if(i<s.size()) x+=s[i];
            if(i<b.s.size()) x+=b.s[i];
            c.s.push_back(x%BASE);
            g = x/BASE;
        }
        return c;
    }
};
ostream& operator<<(ostream &out,const BigInteger& x){
    out<<x.s.back();
    for(int i=(int)x.s.size()-2;i>=0;i--){
        char buf[20];
        sprintf(buf,"%08d",x.s[i]);
        for(int j=0;j<strlen(buf);j++){
            out<<buf[j];
        }
    }
    return out;
}
BigInteger a[205];
void init(){
    a[1]=1;
    a[2]=2;
    for(int i=3;i<=200;i++){
        a[i]=a[i-1]+a[i-2];
        //cout<<a[i]<<endl;
    }
}
int main(){
    //freopen("input.txt","r",stdin);
    init();
    int n;
    while(cin>>n){
        if(n==0){
            cout<<endl;
            continue;
        }
        cout<<a[n]<<endl;
    }
    return 0;
}