#include<bits/stdc++.h>

using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<vector<int> > vvi;
#define forn(i,x,y) for(i = (x) ; i <= (y) ; ++i)
#define forr(i,y,x) for(i = (y) ; i >= (x) ; --i)
#define forv(v,i) for(i=v.begin();i!=v.end();++i)
#define forvr(v,i) for(i=v.end()-1;i!=v.begin();--i)
#define FA(i, a) for (__typeof((a).begin()) i = (a).begin(); i != (a).end(); i++)
#define PB push_back
#define PF push_front
#define MP make_pair
#define F first
#define S second
#define SZ(x) ((int)(x).size())
#define MOD(x,y) (((x%M)*(y%M))%M)
#define CLR(x,y) memset(x,y,sizeof(x))
#define precisionvalue printf("%.6lf\n",ans);
ll M=1000000007;
//while(~scanf("%d",&n) )
/*-------------------------Template Ends--------------------------------*/

ll isprime[100005];

int main()
{
//	ios::sync_with_stdio(0);
//	cin.tie(0);
	ll i,j,k,n,m,p,q,u,v,count,ans,temp,test;
    for(i=3;i<=100003;i++)
    {
        if(i&1)
            isprime[i]=1;
        else
            isprime[i]=0;
    }
    isprime[2]=1;
    isprime[1]=0;
    for(i=3;i<=100003;i+=2)
    {
        if(isprime[i])
        {
            for(j=i*i;j<=100003;j+=i)
                isprime[j]=0;
        }
    }
    forn(i,2,100002)
    {
        isprime[i]+=isprime[i-1];
   //     cout << i << " " << isprime[i] << endl;
    }
    cin >> test ;
    while(test--)
    {
        cin >> n;
        if(isprime[n]&1)
            cout << "Alice\n";
        else
            cout << "Bob\n";
    }
	return 0;
}