ACM - UVA 900 - brick wall patterns

The problem:900 - Brick Wall Patterns
The solution: C++
Hints: http://www.algorithmist.com/index.php/UVa_900
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <utility>
#include <set>
#include <math.h>
using namespace std;

char * fib[] = {"1","2","3","5","8","13","21","34","55","89","144","233","377","610","987",
"1597","2584","4181","6765","10946","17711","28657","46368","75025",
"121393","196418","317811","514229","832040","1346269","2178309",
"3524578","5702887","9227465","14930352","24157817","39088169",
"63245986","102334155","165580141","267914296","433494437",
"701408733","1134903170","1836311903","2971215073","4807526976",
"7778742049","12586269025","20365011074"};

int main()
{
     int n;
     while(1)
     {
          scanf("%d",&n);
          if(!n) break;
              puts(fib[n-1]);
     }
}