//
//  na 2484.cpp
//  Competitive Programming
//
//  Created by m2 on 2024/11/26.
//

#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1e6 + 5;
int n, a[maxn];
inline int rd(){
    int v = 0; char r = getchar();
    while(r - 48 >= 10u)
        r = getchar();
    do{
        v = (v << 3) + (v << 1) + (r ^ 48);
        r = getchar();
    }while(r - 48 < 10u);
    return v;
}
inline void solve(){
    n = rd();
    for(int i = 0; i < n; ++i)
        a[i] = rd();
    if(n == 2){
        if(a[0] ^ a[1])
            cout << "Alice" << endl;
        else
            cout << "Bob" << endl;
        return;
    }
    sort(a, a + n);
    int maxc = 1, c = 1;
    for(int i = 1; i < n; ++i)
        if(a[i] == a[i - 1]){
            maxc = max(maxc, ++c);
        }else{
            c = 1;
        }
    if(maxc > (n >> 1))
        cout << "Bob" << endl;
    else
        cout << "Alice" << endl;
}
int main(){
    cin.tie(0)->sync_with_stdio(false);
#ifdef MAC_OS_VERSION_11_0
    freopen("/Users/m2/Downloads/ex_nim3.in", "r", stdin);
    freopen("/Users/m2/Downloads/ex_nim3.out", "w", stdout);
#endif
    int t = rd();
    while(t--)
        solve();
    return 0;
}