#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;

int seive[100009];
void seiv()
    {
    seive[0]=seive[1] = 0;
    for(int i=2;i<100009;i++)seive[i]=1;
    for(int i=2;i*i<100009;i++)
        {
        if(seive[i])for(int j=i*i;j<100009;j+=i)seive[j]=0;
    }
    for(int i=1;i<100009;i++)seive[i]+=seive[i-1];
}

int main(){
    int g;
    cin >> g;
    seiv();
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(seive[n]&1)cout << "Alice\n";
        else cout << "Bob\n";
    }
    return 0;
}