#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void solve() {
    int N;
    cin >> N;
    vector<int> A(N);
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
    }
    
    sort(A.begin(), A.end());
    
    vector<int> piles;
    int current_val = A[0];
    int count = 1;
    
    if (current_val > 0) {
        piles.push_back(current_val);
    }
    
    for (int i = 1; i < N; ++i) {
        if (A[i] == current_val) {
            count++;
        } else {
            piles.push_back(count);
            piles.push_back(A[i] - current_val);
            current_val = A[i];
            count = 1;
        }
    }
    piles.push_back(count);
    
    for (size_t i = 0; i < piles.size(); ++i) {
        if (piles[i] > 1) {
            if (i % 2 == 0) cout << "Alice\n";
            else cout << "Bob\n";
            return;
        }
    }
    
    if (piles.size() % 2 != 0) cout << "Alice\n";
    else cout << "Bob\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int T;
    if (cin >> T) {
        while (T--) solve();
    }
    return 0;
}