#include<bits/stdc++.h>
using namespace std;
const int N=1e6;
int prime[N];
vector<int>p;
void sieve()
{
    for(int i=2;i*i<=1e5;i++)
    {
        if(!prime[i])
        for(int j=i*i;j<=1e5;j+=i)
              prime[j]++;
    }
    p.push_back(1);
    for(int i=2;i<=1e5;i++)
        if(!prime[i])
        {
            //cout<<i<<" ";
            p.push_back(i);
        }
            
    //cout<<"DoNe"<<endl;
    //cout<<p.size()<<endl;
}
int main() {
    sieve();
    int g,n;
    cin>>g;
    while(g--)
    {
        cin>>n;
        //int sz=lower_bound(p.begin(),p.end(),n)-p.begin();
        //sz++;
        //cout<<n<<" "<<sz<<endl;
        int sz=0;
        for(int i=1;i<=n;i++)
            if(!prime[i])sz++;
        if(sz%2==0)
           cout<<"Alice\n";
        else
            cout<<"Bob\n";
    }
    return 0;
}