// Problem: B. 取石子
// Contest: undefined - NOIP2024训练赛 14
// URL: http://noi.ac/contest/1166/problem/2484
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
//#define int long long
#define fi first
#define se second
#define PII pair<int, int>

using namespace std;

const int N = 1e6 + 10, M = 1e6 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;

int n, m, q, ans = INF;
int s[N], dp[N];

vector<int> e[N];

inline void solve()
{
   	cin >> n; ans = INF;
    int cnt1 = 0, cnt2 = 0;
    for(int i = 1; i <= n; i ++) cin >> s[i]; 
    sort(s + 1, s + n + 1);
    for(int i = 1; i <= n; i ++)
    {
        if(s[i] == s[1])
        {
            cnt1 ++;
            continue;
        }
        if(ans == 0x3f3f3f3f) ans = s[i];
        if(ans != s[i])break;
        cnt2 ++;
    }
    if(cnt1 == n) cout << "Bob" << '\n';
    else
    {
        if(cnt1 <= n / 2) cout << "Alice" << '\n';
        else cout << "Bob" << '\n';
    }
}

signed main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int T; cin >> T;
	while(T --) solve();
	return 0;
}