#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
typedef vector<int> vi;
typedef pair<double,double> pdd;
typedef vector<long long> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdd;
 
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define MOD 1000000007
#define ll long long
ll GCD(ll a, ll b)
{
    return b? GCD(b,a%b) : a;
}
bool chk(string first, string second)
{
    string t1 = first + second;
    string t2 = second + first;
    return t1 < t2;
}
struct sort_pred
{
    bool operator()(const pair<int,int> &left, const pair<int,int> &right)
    {
        return left.second < right.second;
    }
};
long long POW(long long Base, long long Exp)
{
    long long y,ret=1;
    y=Base;
    while(Exp)
    {
        if(Exp&1)
            ret=(ret*y)%MOD;
        y = (y*y)%MOD;
        Exp/=2;
    }
    return ret%MOD;
}
 
vll A,B,C,D,Res,Mark;
string str2,str1,s1,s2;
set<string> st;
stack<ll> chlo;
vpll Rec;
string ItoS(ll n)
{
	ll num = n;
	ll tmp;
	string ans ="";
	while(num)
	{
		tmp = num%10;
		ans = ans + (char)('0'+tmp);
		num/=10;
	}
	reverse(ans.begin(),ans.end());
 
	return ans;
}
int cont(ll n)
{
  	ll count = 0;
  	while(n)
  	{
    	count += n & 1;
    	n >>= 1;
  	}
  	return count;
}
set<ll> At,Bt;
set<ll>::iterator itr;
vector<string> kyu,andar,bahar;
#define itfr(it,stl) for(it=stl.begin();it!=stl.end();it++)

map <pll, ll> Reg;
map<ll,ll> ::iterator it;
vector<vll> Graph;

#define MAX 1000007

int sp[MAX],v[MAX];
void Sieve()
{
	int i,j;
	for(i=2; i<MAX; i+=2)
								sp[i] = 2;//even numbers have smallest prime factor 2
	for(i=3; i<MAX; i+=2)
	{
		if (!v[i])
		{
			sp[i] = i;
			for(long long j=i; (j*i)<MAX; j+=2)
			{
				if(!v[j*i])
						v[j*i] = 1, sp[j*i] = i;
			}
		}
	}
}
int main()
{
    ll i,j,k,l,m,n,x,y,z,t,tmp1,tmp2,tmp3,ind,Max,d1,d2;
	
	sp[0]=sp[1]=0;
    Sieve();
	B.resize(MAX);
	x = 0;
	for(i=2; i<MAX; i++)
	{
		if(i==sp[i])
					x++;
		B[i] = x;
	}
	cin>>t;
    while(t--)
    {
    	cin>>n;
    	
    	if(B[n]&1)
    				cout<<"Alice"<<endl;
		else
					cout<<"Bob\n";
    }
   	return 0;
}