#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<algorithm>
#include<bitset>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<cmath>
#include<string>
#include<cstring>
#include<sstream>
#include<climits>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef set<int> si;
typedef map<string, int> msi;

#define S(x) scanf("%d",&x)
#define SD(x) scanf("%lf",&x)
#define SL(x) scanf("%lld",&x)
#define pb(x) push_back(x)
#define mp make_pair
#define F(i, a, b) for (int i = int(a); i < int(b); i++)
#define forit(it, a) for (it = (a).begin(); it != (a).end(); it++)
#define M(x,i) memset(x,i,sizeof(x))

/* -------------------CODE GOES HERE---------------------- */

int main(){

	int g; S(g);
	int n;

	bool primes[100010];
	M(primes,true);

	for (int p=2; p*p<=100009; p++) {
        
        if (primes[p] == true) {
            for (int i=p*2; i<=100009; i += p)
                primes[i] = false;
        }
    }

	vi p;

	p.pb(0);
	p.pb(0);
	int x = 0;

	F(i,2,1e5+10){
		if(primes[i]) p.pb(++x);
		else p.pb(x);
	}
	
	while(g--){
		S(n);

		printf((p[n])%2 ? "Alice\n" : "Bob\n");
	}

}