#include <bits/stdc++.h>

using namespace std;

const unsigned MAX = 1000000/60, MAX_S = sqrt(MAX/60);

unsigned w[16] = {1, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 49, 53, 59};
unsigned short composite[MAX];
vector<int> primes;

void sieve(){
    unsigned mod[16][16], di[16][16], num;
    for (int i = 0; i < 16; i++)
        for (int j = 0; j < 16; j++){
            di[i][j] = (w[i]*w[j])/60;
            mod[i][j] = lower_bound(w, w + 16, (w[i]*w[j])%60) - w;
        }

    primes.push_back(2); primes.push_back(3); primes.push_back(5);

    memset(composite, 0, sizeof composite);
    for (unsigned i = 0; i < MAX; i++)
        for (int j = (i==0); j < 16; j++){
            if (composite[i] & (1<<j)) continue;
            primes.push_back(num = 60*i + w[j]);

            if (i > MAX_S) continue;
            for (unsigned k = i, done = false; !done; k++)
                for (int l = (k==0); l < 16 && !done; l++){
                    unsigned mult = k*num + i*w[l] + di[j][l];
                    if (mult >= MAX) done = true;
                    else composite[mult] |= 1<<mod[j][l];
                }
        }
}

int main() {
    sieve();
    int n;
    cin >> n;
    while (n--){
        int x;
        cin >> x;
        vector<int>::iterator up;
        up = upper_bound(primes.begin(), primes.end(), x);
        int value = (int)(up-primes.begin());
        if (value % 2 != 0) cout << "Alice\n";
        else cout << "Bob\n";
    }
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}