UVA_900_Brick_Wall_Patterns

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define LL unsigned long long
using namespace std;

int fib[51];
void init(){
 fib[0]=1;fib[1]=1;fib[2]=2;
 for (int i=3;i<=51;i++){
    fib[i]=fib[i-1]+fib[i-2];
 }
}
int main() {
    int n;
    init();
    while(scanf("%d",&n)){
        if(n==0) break;
        printf("%d\n",fib[n]);
    }
    return 0;
}