#include<bits/stdc++.h>
#define tr(v,it) for(auto it=v.begin();it!=v.end();it++)
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define F first
#define S second
using namespace std;
vector<bool>prime(100001,true);
const long long N=100001;
void seive()
{
  prime[1]=prime[0]=false;
  for(long long i=2;i<N;i++)
  {
    if(prime[i])
    {
      if(i*1LL*i<N)
      {
        for(long long j=i*i;j<N;j+=i)
        prime[j]=false;
      }
    }
  }
}
int main()
{
//freopen("input.txt","r",stdin);
seive();
vector<long long>count(100001);
long long temp=0;
for(long long i=1;i<100001;i++)
{
  if(prime[i])
  temp+=1;
  count[i]=temp;
}

long long t;
cin>>t;
while(t--)
{
  long long n;
  cin>>n;
  if(count[n]%2==0)
  cout<<"Bob"<<endl;
  else
  cout<<"Alice"<<endl;
}


  return 0;
}