//Alice and Bob's Silly Game
//https://www.hackerrank.com/contests/101hack44/challenges/alice-and-bobs-silly-game
#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;

int g,n,p[100005],index;
int prime(int n)
{
    for(int i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
            return 0;
    }
    return 1;
}

int main()
{
   // freopen("text","w",stdout);
    cin>>g;
    p[1]=0;
    index=1;
    while(g--)
    {
        int prost;
        cin>>n;
        if(n>index)
        {
            prost=p[index];
            for(int i=index+1;i<=n;i++)
            {
                if(prime(i))
                    prost++;
                p[i]=prost;
            }
            index=n;
        }
        if(p[n]%2==0)
            cout<<"Bob"<<"\n";
        else
            cout<<"Alice"<<"\n";

    }
    return 0;
}