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

vector<int> p;
void genprime(int n) {
    p.resize(n + 1, 1);
    p[0] = p[1] = 0;
    for (int i = 2; i <= n; ++i) {
        if (!p[i]) continue;
        p[i] = 1;
        for (long long f = (long long) i * (long long) i; f <= n; f += i)
            p[f] = 0;
    }
}


int main(){
    int g;
    cin >> g;
    genprime(101010);
    partial_sum(p.begin(), p.end(), p.begin());
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if (p[n] & 1) cout << "Alice\n";
        else cout << "Bob\n";
    }
    return 0;
}