#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

#define N 100000
int p[N+10],c[N+10];

int main(){
int k=0,i;
for(i=2;i*i<=N;i++)
{
	if(p[i])
	{
		c[i] = k;
		continue;
	}
	c[i] = ++k;
	for(int j=i+i;j<=N;j+=i)
		p[j]++;
}
for(;i<=N;i++)
{
	if(p[i])
	{
		c[i] = k;
		continue;
	}
	c[i] = ++k;
}

    
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        cout << ((c[n]&1) ? "Alice" : "Bob") << endl;
    }
    return 0;
}