#include<bits/stdc++.h>
using namespace std;


bool prime[100005];
int ans[100005];

void cal()
{
    memset(prime, true, sizeof(prime));
    prime[0] = prime[1] = false;
    for(int i=2; i*i<100000; i++)
    {
        if(prime[i])
        {
            for(int j=i*2; j<=100000; j+=i)
                prime[j] = false;
        }
    }
    for(int i=2; i<=100000; i++)
    {
        if(prime[i])
            ans[i] = ans[i-1]+1;
        else
            ans[i] = ans[i-1];
    }

}

int main()
{
    cal();
    int t, n;
    cin>>t;
    while(t--)
    {
        cin>>n;
        if(ans[n]%2==0)
        {
            cout<<"Bob"<<endl;
        }
        else
            cout<<"Alice"<<endl;
    }
}