/*I MAY NOT GET THE SUCCESS IMMEDIATELY BUT I WILL GET IT FOR SURE*/
#include<bits/stdc++.h>
#define opt std::ios_base::sync_with_stdio(false)
#define I int
#define li		int32_t
#define lli		long long
#define ulli unsigned long long

#define pn			printf("\n")
#define nl			cout<<'\n'

#define rep(i,a,b)	for(i=a;i<b;i++)
#define repr(i,a,b)	for(i=a;i>b;i--)
#define elif		else if
#define mset(a,b)	memset(a,b,sizeof(a))

#define pb		push_back
#define pob		pop_back
#define itr		iterator
#define sz()	size()
#define szof    sizeof
#define lb		lower_bound
#define ub		upper_bound
#define mp		make_pair
#define pii		pair<int,int>
#define pll		pair<li,li>
#define vpi		vector<pii >
#define vpl		vector<pll >
#define F		first
#define S		second

#define mod		1000000007
using namespace std;

lli Power(lli a,lli b)
{
    lli result=1;

    while(b)
    {
        if(b%2)
        {
            result=(result*a)%mod;
        }

        b=b>>1;
        a=(a*a)%mod;
    }

 return result;
}

int main()
{
    opt;

    lli i,j,Total=1000000;
    vector<lli>V;
    vector<lli>V1;

    rep(i,0,Total+1)
    {
        V1.pb(i);
    }

    for(i=2;i<=sqrt(Total);i++)
    {
        for(j=2;j<=Total/i;j++)
        {
            V1[i*j]=0;
        }
    }

    rep(i,2,V1.sz())
    {
        if(V1[i])
        {
            V.pb(V1[i]);
        }
    }
    
    V1.clear();
    
    lli T;
    cin>>T;
    
    while(T--)
    {
        lli N,i;
        cin>>N;
        
        i=0;
        lli cnt=0;
        while(V[i]<=N)
        {
            cnt++;
            i++;
        }    
        
        if(cnt%2)
        {
            cout<<"Alice";
        }    
        else
        {
            cout<<"Bob";
        }    
        nl;
    }





 return 0;
}