#include <bits/stdc++.h>

using namespace std;

const int MaxN = 1000005;

int g, n;

bitset<MaxN> bs;

int read() {
    if (scanf("%d", &n) < 1) {
        return 0;
    }
    return 1;
}

void solve() {
    int primes = 0;
    for (int i = 1; i <= n; i++) {
        if (bs[i]) primes++;
    }
    if (primes%2 == 0) {
        printf("Bob\n");
    }
    else {
        printf("Alice\n");
    }
}

void sieve() {
    bs.set();
    bs[0] = 0;
    bs[1] = 0;
    for (long long i = 2; i < MaxN; i++) {
        if (bs[i]) {
            for (long long j = i * i; j < MaxN; j+=i) {
                bs[j] = 0;
            }
        }
    }
}

int main() {
    sieve();
    scanf("%d", &g);
    while (read() && g--) {
        solve();
    }
}