#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#define  ll long long int

using namespace std;
ll ct;
void sieve(int mx)
{
    
    vector<bool> a(mx+10);
    
	for(ll i=3;i*i<=mx;i+=2)
	{
		if(a[i]==0)
		{
			ll j=i*i;
			ll z=i<<1;
			
			while(j<=mx)
			{
				a[j]=1;
				j+=z;
			}
		}
	}
	
	
	ct=1;
	for(ll i=3;i<=mx;i+=2)
	{
		if(a[i]==0)
		{
			ct++;
		}
	}
	
}

int main(){
    ll g;
    cin >> g;
    for(ll a0 = 0; a0 < g; a0++){
        ll n;
        cin >> n;
        
        if(n==1)ct=0;
        else sieve(n);
        
        if(ct%2==0)cout<<"Bob\n";
        else cout<<"Alice\n";
        // your code goes here
    }
    return 0;
}