#include <iostream>
using namespace std;
 
int main() {
    int t;
    cin >> t;
 
    while (t--) {
        int n;
        cin >> n;
 
        // Count numbers in each remainder class (mod 4)
        int count[4] = {0, 0, 0, 0};
 
        for (int i = 0; i < n; i++) {
            count[i % 4]++;
        }
 
 
        if (count[0] != count[3] || count[1] != count[2]) {
            cout << "Alice\n";
        } else {
            // Both pairs are balanced
            // Alice wins if the total number of pairs is odd
            int total_pairs = count[0] + count[1]; // = count[3] + count[2]
            if (total_pairs % 2 == 1) {
                cout << "Alice\n";
            } else {
                cout << "Bob\n";
            }
        }
    }
 
    return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OwogICAgCiAgICB3aGlsZSAodC0tKSB7CiAgICAgICAgaW50IG47CiAgICAgICAgY2luID4+IG47CiAgICAgICAgCiAgICAgICAgLy8gQ291bnQgbnVtYmVycyBpbiBlYWNoIHJlbWFpbmRlciBjbGFzcyAobW9kIDQpCiAgICAgICAgaW50IGNvdW50WzRdID0gezAsIDAsIDAsIDB9OwogICAgICAgIAogICAgICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgICAgIGNvdW50W2kgJSA0XSsrOwogICAgICAgIH0KICAgICAgICAKICAgICAgICAKICAgICAgICBpZiAoY291bnRbMF0gIT0gY291bnRbM10gfHwgY291bnRbMV0gIT0gY291bnRbMl0pIHsKICAgICAgICAgICAgY291dCA8PCAiQWxpY2VcbiI7CiAgICAgICAgfSBlbHNlIHsKICAgICAgICAgICAgLy8gQm90aCBwYWlycyBhcmUgYmFsYW5jZWQKICAgICAgICAgICAgLy8gQWxpY2Ugd2lucyBpZiB0aGUgdG90YWwgbnVtYmVyIG9mIHBhaXJzIGlzIG9kZAogICAgICAgICAgICBpbnQgdG90YWxfcGFpcnMgPSBjb3VudFswXSArIGNvdW50WzFdOyAvLyA9IGNvdW50WzNdICsgY291bnRbMl0KICAgICAgICAgICAgaWYgKHRvdGFsX3BhaXJzICUgMiA9PSAxKSB7CiAgICAgICAgICAgICAgICBjb3V0IDw8ICJBbGljZVxuIjsKICAgICAgICAgICAgfSBlbHNlIHsKICAgICAgICAgICAgICAgIGNvdXQgPDwgIkJvYlxuIjsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgIH0KICAgIAogICAgcmV0dXJuIDA7Cn0=

NQoyCjQKNQo3CjEwMAo=

5
2
4
5
7
100