/******************************************
*    AUTHOR:         BHUVNESH JAIN        *
*    INSTITUITION:   BITS PILANI, PILANI  *
******************************************/
#include <bits/stdc++.h>
using namespace std;
 
typedef long long LL; 
typedef long double LD;

const int MAX = 1000001;

int lp[MAX];
vector<int> primes;
 
void factor_sieve() {
	lp[1] = 1;
	for (int i=2; i<MAX; ++i) {
		if (lp[i] == 0) {
			lp[i] = i;
			primes.emplace_back(i);
		}
		for (int j=0; j<primes.size() && primes[j]<=lp[i]; ++j) {
			int x = i * primes[j];
			if (x >= MAX) break;
			lp[x] = primes[j];
		}
	}
}

int ans[MAX];

void pre() {
	for(int i = 2; i < MAX; ++i) {
		ans[i] = ans[i-1];
		ans[i] += (lp[i] == i);
	}
}

int main() {
	#ifndef ONLINE_JUDGE
		// freopen("inp.txt", "r", stdin);
	#endif
	factor_sieve();
	pre();
	int g, n;
	scanf("%d", &g);
	while(g--) {
		scanf("%d", &n);
		if (ans[n] % 2) puts("Alice");
		else puts("Bob");
	}
	return 0;
}