#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define f(i,n) for(i=0;i<n;i++)
#define gc getchar_unlocked()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define memsetint(a,n,val) f(i,n){a[i]=val;}
#define M 1000000007
#define N 100000
using namespace std;
typedef long long int ll;
typedef double ld;
typedef vector<int> vi;

ll power(ll a,ll b,ll x)
{
    ll ans=1;
    a=a%x;
    while(b)
    {
        if(b&1) ans=(ans*a)%x;
        b>>=1;
        a=(a*a)%x;
    }
    return ans%x;
}

int primes[10000];
int num_p;

void seive()
{
    bool vis[N+1];
    int i,j;
    memsetint(vis,N+1,true);
    vis[0]=vis[1]=false;
    for(i=2;(i*i)<=N;i++)
    {
        if(vis[i])
        {
            for(j=(i*i);j<=N;j+=i)
            {
                vis[j]=false;
            }
        }
    }
    j=0;
    f(i,N+1) if(vis[i]) primes[j++]=i;
    num_p=j;
}

int main()
{_
    int g,n,x,i;
    cin>>g;
    if (g) seive();
    int ans[100001];
    ans[0]=ans[1]=0;
    n=1;
    f(i,num_p-1)
    {
        for(x=primes[i];x<primes[i+1];x++) ans[x]=n;
        n++;
    }
    for(x=primes[num_p-1];x<=N;x++) ans[x]=n;
    while(g--)
    {
        cin>>n;
        cout<<(ans[n]%2 ? "Alice\n": "Bob\n");
    }
    return 0;
}