#include<bits/stdc++.h>
#define N 100010
#define ll long long
#define MOD 1000000007
#define pii pair<int, int>

using namespace std;

int a[N];
bool prime(int n)
{
    if(n<2)
        return 0;
    if(n==2)
        return 1;
    if(n%2==0)
        return 0;
    for(int i=3;i*i<=n;i+=2)
        if(n%i==0)
            return 0;
    return 1;
}
void solve()
{
    bool f=0;
    a[0]=0;
    a[1]=0;
    for(int i=2;i<N;i++)
    {
        if(prime(i))
        {
            f=1-f;
            for(int j=1;i*j<N;j++)
            {
                //cout<<i*j<<" ";
                   if(a[i*j]==-1)
                a[i*j]=f;
            }
        }
        //cout<<i<<" : ";

       // cout<<endl;
    }
}
int main()
{
    for(int i=0;i<N;i++)
        a[i]=-1;
    solve();
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        if(a[n])
            cout<<"Alice"<<endl;
        else
            cout<<"Bob"<<endl;
    }
    return 0;
}