#include <bits/stdc++.h>

using namespace std;

int mark[1000002],nPrime;
int Prime[300000];
vector<int>v;
void sieve(int n)
{
    v.clear();
    memset(mark,0,sizeof mark);
    memset(Prime,0,sizeof Prime);
    int i,j,limit=sqrt(n*1.)+2;
    mark[1]=1;
    for(int i=4;i<=n;i+=2)
        mark[i]=1;

        v.push_back(2);

        for(int i=3;i<=n;i+=2)
        {
            if(!mark[i])
            {
                v.push_back(i);

                if(i<=limit)
                {
                    for(j=i*i;j<=n;j+=i*2)
                    {
                        mark[j]=1;
                    }
                }
            }
        }
}
int main()
{

    int tc,n;
    cin>>tc;
    while(tc--)
    {
        cin>>n;
        if(n==1)
        {
            cout<<"Bob"<<endl;
            continue;
        }
        sieve(n);
       /* for(int i=0;i<v.size();i++)
        {
            cout<<v[i]<<endl;
        }*/
        if(v.size()%2==0)
        {
            cout<<"Bob"<<endl;
        }
        else
        {
            cout<<"Alice"<<endl;
        }

    }
    return 0;
}