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

bool isPrime[1000000];

void sieve(int n)
{
	memset(isPrime, true, sizeof(isPrime));
	int sq = sqrt(n);
	for(int i = 2; i <= sq; ++i) {
		if(isPrime[i]) {
			for(int j = 2; j*i <= n; ++j) {
				isPrime[i*j] = false;
			}
		}
	}
}


int main(){
	sieve(1000000);
    int primeCnt[100005];
    primeCnt[0] = primeCnt[1] = 0;
    for(int i = 2; i <= 100000; ++i) {
        if(isPrime[i]) {
            primeCnt[i] = 1+primeCnt[i-1];
        } else {
            primeCnt[i] = primeCnt[i-1];
        }
    }
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(primeCnt[n]%2 == 0) {
            cout << "Bob\n";
        } else {
            cout << "Alice\n";
        }
    }
    return 0;
}