#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

#define ll long long

int isprime[100001], c[1000001];

void sieve(){
	ll i;
	for(i = 2; i < 100001; i++){
		if (!isprime[i]){
			ll j = i + i;
			while(j < 100001){
				isprime[j] = 1;
				j += i;
			}
		}
	}
	for(i = 2; i < 100001; i++){
		if (!isprime[i]) c[i] = c[i - 1] + 1;
		else c[i] = c[i - 1];
	}
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
    sieve();
    ll n, i;
    scanf("%lld", &n);
    for(i = 0; i < n; i++){
    	int a;
    	scanf("%d", &a);
    	if (c[a] % 2) printf("Alice\n");
    	else printf("Bob\n");
	}
    return 0;
}