#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>

using namespace std;


void sieve(vector<int>& primes,int N)
{
	int i, j;
	vector<bool> isPrime(N + 1, true);
	isPrime[0] = isPrime[1] = false;

	for (i = 2;i <= N;i++)
	{
		if (isPrime[i] == true)
		{
			j = 2 * i;
			while (j<=N)
			{
				isPrime[j] = false;
				j += i;
			}
		}
	}
    primes[0]=1;
	for (i = 1;i <= N;i++){
        if (isPrime[i])
			primes[i]=(primes[i-1]+1)%2;
        else
            primes[i]=primes[i-1];
    }
		
}


int main(){
    int g;
    vector<int> primes(100001);
    sieve(primes,100000);
    cin >> g;
    
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        
        if(primes[n]==0){
            cout<<"Alice\n";
        }
        else{
            cout<<"Bob\n";
        }
        
        
        
        
        
        
        
    }
    return 0;
}