#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bitset>
using namespace std;

#define MAX 100001

bitset<MAX> isprime;

void sieve() {
    for (int i=0; i<MAX; i+=2) isprime[i] = false;
    isprime[1] = false;
    isprime[2] = true;
    int p=3;
    while (1) {
        for (int i=p; i*p<MAX; i+=2) {
            isprime[i*p] = false;
            //printf("false %d by %d\n", i*p, p);
        }
        p+=2;
        while (!isprime[p]) {
            if (p > 1000)
                return;
            p += 2;
        }
    }
}


int main() {
    isprime.set();
    sieve();
    int t, n, s;
    cin >> t;
    for (int i=0; i<t; i++) {
        s = 0;
        cin >> n;
        for (int i=1; i<=n; i++)
            if (isprime[i]) s++;
        printf(s%2 ? "Alice\n" : "Bob\n");
    }
    return 0;
}