C :

#include <stdio.h>
#define N 50
int main()
{
    int Case,n,i,p,f[N]={0,1};
    for(i=2;i<N;i++)
        f[i]=f[i-1]+f[i-2];
    scanf("%d",&Case);
    while(Case--)
    {
        scanf("%d",&n);
        p=0;
        for(i=2;i<50;i++)
        {
            if(f[i]==n)
            {
                p=1;
                break;
            }
        }
        if(p)
            printf("Alice!\n");
        else
            printf("Bob!\n");
    }
    return 0;
}

C++ :

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include <set>
using namespace std;
int a[100];
set<int> Set;
void init(){
    a[1] = 1;
    a[2] = 1;
    int i;
    for(i=3;;i++){
        a[i] = a[i-1] + a[i-2];
       // printf("%d\n",a[i]);
        if(a[i]<0)
            break;
        Set.insert(a[i]);
    }
    //printf("%d\n",i);
}
int main()
{
    //freopen("1.in","w",stdout);
    init();
    int cas;
    int n;
    scanf("%d",&cas);
    while (cas--)
    {
        scanf("%d",&n);
        if(Set.find(n)!=Set.end())
            printf("Alice!\n");
        else
            printf("Bob!\n");
    }
    return 0;
}