#include <bits/stdc++.h>

#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(a) a.begin(),a.end()
#define pb push_back

typedef unsigned long long llu;
typedef long long ll;
typedef long double ld;

using namespace std;

vector<int> primes;

bool isPrime(int n){
	if(n <= 1) return false;
	else if(n <= 3) return true;
	else if(n%2 == 0 || n%3 == 0) return false;
	int i = 5;
	while(i*i <= n){
		if(n%i == 0 || n%(i+2) == 0) return false;
		i += 6;
	}
	return true;
}

int main(){
	int cnt = 0, g, n;
	for(int i = 0; i <= 100000; i++){
		if(isPrime(i)) cnt++;
		primes.pb(cnt);
	}
	scanf("%d", &g);
	while(g--){
		scanf("%d", &n);
		if(n <= 1) cout << "Bob\n";
		else {
			if((primes[n])&1) cout << "Alice\n";
			else cout << "Bob\n";
		}
	}
	return 0;
}