#include <iostream>
using namespace std;
 
#include<stdio.h>
#define value 5001
#define len 1050
int table[value][len];
 
void fibo()
{
    int i,j;
    table[0][0]=0;
    table[1][0]=1;
    table[2][0]=1;
 
    for(i=3;i<value ;i++)
    {
        for(j=0;j<len;j++)
        {
            table[i][j]+=table[i-2][j]+table[i-1][j];
            if(table[i][j]>=10)                    // if 13 then make 3,  17 then 7
            {
                table[i][j+1]+=table[i][j]/10;
                table[i][j]%=10;
            }
        }
    }
}
 
int main()
{
    fibo();
    int n,i;
    while(scanf("%d",&n)==1)
    {
        for(i=len-1;i>0;i--)
            if(table[n][i]!=0)        // if get any value then stop.    Avoiding 0.
                break;
 
        printf("The Fibonacci number for %d is ",n);
 
        for(;i>=0;i--)                        // printing in reverse order
            printf("%d",table[n][i]);
 
        printf("\n");
 
    /*    for(i=0;i<10;i++){                Open the comment to see the 2d table
            for(n=0;n<10;n++)
                printf("%d ",table[i][n]);
            printf("\n");
        }
*/
 
    }
    return 0;
}