hdu 1848 Fibonacci again and again

// Time 0ms, Memory 236K

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int fb[16],sg[1001],v[1001];
int mex(int x)
{
    if(sg[x]!=-1) return sg[x];
    int i;
    memset(v,0,sizeof(v));
    for(i=1;i<16 && x-fb[i]>=0;i++)
    {
        sg[x-fb[i]]=mex(x-fb[i]);
        v[sg[x-fb[i]]]=1;
    }
    for(i=0;;i++) if(!v[i]) return i;
}
int main()
{
    int i,m,n,p,ans;
    memset(sg,-1,sizeof(sg));
    sg[0]=0;
    fb[0]=fb[1]=1;
    for(i=2;i<16;i++) fb[i]=fb[i-1]+fb[i-2];
    for(i=1;i<1001;i++) sg[i]=mex(i);
    while(scanf("%d%d%d",&n,&m,&p)!=EOF && (m || n || p))
    {
        ans=sg[m]^sg[n]^sg[p];
        if(ans) printf("Fibo\n");
        else printf("Nacci\n");
    }
    return 0;
}