#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
cin >> T;
while (T--) {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
// 각 비트별 등장 횟수
vector<int> cnt(31, 0);
for (int x : A)
for (int b = 0; b < 31; b++)
if (x >> b & 1)
cnt[b]++;
// 가장 높은 비트에서 홀수 개의 1이 존재하는지 확인
bool alice = false;
for (int b = 30; b >= 0; b--) {
if (cnt[b] % 2 == 1) {
// 이 비트가 홀수 개라면,
// 전체 중에서도 cnt[b] % 4 == 1 이면 Alice 승,
// == 3 이면 Bob 승.
if (cnt[b] % 4 == 1) alice = true;
else alice = false;
break;
}
}
cout << (alice ? "Alice\n" : "Bob\n");
}
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKICAgIGlvczo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsKICAgIGNpbi50aWUobnVsbHB0cik7CgogICAgaW50IFQ7CiAgICBjaW4gPj4gVDsKICAgIHdoaWxlIChULS0pIHsKICAgICAgICBpbnQgTjsKICAgICAgICBjaW4gPj4gTjsKICAgICAgICB2ZWN0b3I8aW50PiBBKE4pOwogICAgICAgIGZvciAoaW50IGkgPSAwOyBpIDwgTjsgaSsrKSBjaW4gPj4gQVtpXTsKCiAgICAgICAgLy8g6rCBIOu5hO2KuOuzhCDrk7HsnqUg7Zqf7IiYCiAgICAgICAgdmVjdG9yPGludD4gY250KDMxLCAwKTsKICAgICAgICBmb3IgKGludCB4IDogQSkKICAgICAgICAgICAgZm9yIChpbnQgYiA9IDA7IGIgPCAzMTsgYisrKQogICAgICAgICAgICAgICAgaWYgKHggPj4gYiAmIDEpCiAgICAgICAgICAgICAgICAgICAgY250W2JdKys7CgogICAgICAgIC8vIOqwgOyepSDrhpLsnYAg67mE7Yq47JeQ7IScIO2ZgOyImCDqsJzsnZggMeydtCDsobTsnqztlZjripTsp4Ag7ZmV7J24CiAgICAgICAgYm9vbCBhbGljZSA9IGZhbHNlOwogICAgICAgIGZvciAoaW50IGIgPSAzMDsgYiA+PSAwOyBiLS0pIHsKICAgICAgICAgICAgaWYgKGNudFtiXSAlIDIgPT0gMSkgewogICAgICAgICAgICAgICAgLy8g7J20IOu5hO2KuOqwgCDtmYDsiJgg6rCc652866m0LAogICAgICAgICAgICAgICAgLy8g7KCE7LK0IOykkeyXkOyEnOuPhCBjbnRbYl0gJSA0ID09IDEg7J2066m0IEFsaWNlIOyKuSwKICAgICAgICAgICAgICAgIC8vID09IDMg7J2066m0IEJvYiDsirkuCiAgICAgICAgICAgICAgICBpZiAoY250W2JdICUgNCA9PSAxKSBhbGljZSA9IHRydWU7CiAgICAgICAgICAgICAgICBlbHNlIGFsaWNlID0gZmFsc2U7CiAgICAgICAgICAgICAgICBicmVhazsKICAgICAgICAgICAgfQogICAgICAgIH0KCiAgICAgICAgY291dCA8PCAoYWxpY2UgPyAiQWxpY2VcbiIgOiAiQm9iXG4iKTsKICAgIH0KfQ==