Fibo

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
struct big{
    static const long long MX=999999999;
    long long l,a[150];
    big(int A=0):l(1){a[0]=A;}
    bool eq(int h){return l==1&&a[0]==h;}
    void operator=(int h){
        a[0]=h;
        l=1;
    }/*Care - if used on itself, remove '&'!*/
    void operator+=(big &b){
        for(int i(0);i<b.l;++i)
            add(b.a[i],i);
    }
    void add(long long s,int nd){
        if(nd==l)
            a[l++]=0;
        a[nd]+=s;
        if(a[nd]>MX)
            a[nd]-=MX+1,add(1,nd+1);
    }
    void prt(void){
        printf("%lld",a[l-1]);
        for(int i(l-2);~i;--i)
            printf("%09lld",a[i]);
    }
}f[5001];
int main(void){
    *f=0,f[1]=1;
    FT(2,5001)f[k]=f[k-1],f[k]+=f[k-2];
    int N;
    while(~scanf("%d",&N))
        printf("The Fibonacci number for %d is ",N),f[N].prt(),putchar_unlocked(10);
    return 0;
}