#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> ii;

#define fill(a,x) memset(a,x,sizeof(a)) 
#define pb push_back
#define sz(x) (int)x.size() 
#define F first
#define S second
#define FOR(i,a,b) for(int i = a; i<=b; ++i)
#define NFOR(i,a,b) for(int i = a; i>=b; --i)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
const ll INF = 1e18;
const ll mod = 1e9+7;
const int N = 1e5+10; 

vector<int>primes;
bool done[100010]={false};
void sieve()
{
	int lim=sqrt(100010);
  primes.pb(2);
  for(int i=3;i<=100010;i+=2)
  {
      if(!done[i])
      {	
      	primes.pb(i);

        if(i<=lim)
      	for(int j=i;j*i<=100010;j+=2)
      	{
            done[j*i]=true;
      	}
      }
  }
}

int ans[100010];
int main(){
  fast;
  fill(done,0);
  sieve();
  ans[1]=0;
  ans[2]=1;
  int prev=2;
  FOR(i,1,primes.size()-1)
  {
     int cur=primes[i];
     FOR(j,prev+1,cur-1)
     ans[j]=ans[prev];
     
     ans[cur]=ans[prev]+1;
     prev=cur;
  }
  
  int g;
  cin>>g;

  FOR(i,1,g)
  {
  	int n;
  	cin>>n;
  	if(ans[n]%2)
  		cout<<"Alice"<<endl;
  	else
  		cout<<"Bob"<<endl;
  }
  
  return 0;
}