#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  int n; cin >> n;
  vector<int> a(n); REP(i, n) cin >> a[i];
  if (n % 2 == 0) {
    sort(ALL(a));
    for (int i = 1; i < n; i += 2) {
      if (a[i - 1] < a[i]) {
        cout << "Alice\n";
        return;
      }
    }
    cout << "Bob\n";
  } else {
    cout << "Alice\n";
  }
}

int main() {
  int t; cin >> t;
  while (t--) solve();
  return 0;

  map<tuple<vector<int>, int, int, bool>, bool> dp;
  auto f = [&](auto&& f, vector<int> a, int alice, int bob, bool turn) -> bool {
    if (dp.count({a, alice, bob, turn}) == 1) return dp[{a, alice, bob, turn}];
    bool& v = dp[{a, alice, bob, turn}];
    if (turn) {
      if (alice > 0 && !f(f, a, alice - 1, bob, !turn)) return v = true;
    } else {
      if (bob > 0 && !f(f, a, alice, bob - 1, !turn)) return v = true;
    }
    REP(i, a.size()) {
      FOR(j, 1, a[i]) {
        a[i] -= j;
        if (!f(f, a, alice, bob, !turn)) return v = true;
        a[i] += j;
      }
      vector<int> b = a;
      b.erase(b.begin() + i);
      if (turn) {
        if (!f(f, b, alice + 1, bob, !turn)) return v = true;
      }  else {
        if (!f(f, b, alice, bob + 1, !turn)) return v = true;
      }
    }
    return v = false;
  };
}