#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define sz size
#define MOD 1000000007LL
#define MAXN 100005
using namespace std;
int prime[MAXN], primeCount[MAXN];
void sieve(){
	for(int i = 2; i < MAXN; i++){
		primeCount[i] = primeCount[i - 1];
		if(prime[i] == 0){
			primeCount[i]++;
			if(i < MAXN / 10){
				for(int j = i * i ; j < MAXN; j += i) prime[j] = 1;
			}
		}
	}
	return;
}

int main(){
	int i, j, t, n, m, k, l, r, temp, mini, maxi = 0, flag, cnt = 0, type, test;
	sieve();
	cin >> t;
	while(t--){
		cin >> n;
		if(primeCount[n] % 2) cout << "Alice" << endl;
		else cout << "Bob" << endl;
	}
	return 0;
}