#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
#define pb push_back
#define mp make_pair
#define N 100005

bool is_prime[N];
map<ll,ll>m;

void sieve(ll n)
{
    memset(is_prime,true,sizeof is_prime);

    is_prime[0]=false;
    is_prime[1]=false;

    for(ll i=2;i*i<=n;i++)
    {
        if(is_prime[i]==true)
        {
            for(ll j=i*i;j<=n;j+=i)
            {
                is_prime[j]=false;
            }
        }
    }

    ll cnt=0,temp;
    for(ll i=0;i<N;i++)
    {
        if(is_prime[i])
        {
            cnt++;
            m[i]=cnt;
            temp=m[i];
        }
        m[i]=temp;
    }
}

int main()
{
//    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
    sieve(N);
    ll n;
    cin>>n;
    while(n--)
    {
        ll a;
        cin>>a;
        ll b=m[a];

        if(b%2)cout<<"Alice"<<endl;
        else cout<<"Bob"<<endl;
    }
    return 0;
}