#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repp(i,a,b) for(ll i=a;i<=b;i++)
#define reff(i,a,b) for(ll i=a;i>=b;i--)
#define ll long long int
#define pll pair<ll,ll>
#define mb make_pair
#define pb push_back
#define F first
#define S second
#define M 1000000007
#define dbg(a)         std::cerr<<#a<<"="<<(a)<<"\n"
#define dbg1(a,b)       std::cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define dbg2(a,b,c)     std::cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define dbg3(a,b,c,d)   std::cerr<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
bool b[100005]={0};
vector<ll>vv;
ll lp[100005];
void sieve()
{
	ll i,j;
	b[0]=1;b[1]=1;
       for(i=4;i<100001;i+=2)
        b[i]=1;
        lp[2]=1;
	for(i=3;i<=100001;i++)
          {
     	    lp[i]=lp[i-1];
     	   // dbg(lp[i]);
     		if(b[i]==0)
     		{
     			lp[i]+=1;
     			//dbg(lp[i]);
     			for(j=i*i;j<=100001;j+=i)
     			{
     				b[j]=1;
     			}
     		}
           }
    
}

int main()
{
  ll t,n;
  cin>>t;
  sieve();
  while(t--)
  {
  	cin>>n;
  	//dbg(lp[n]);
  	if(lp[n]&1)
  	cout<<"Alice"<<endl;
  	else
  	cout<<"Bob"<<endl;
  }

}