#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)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int 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;

int g(const int n) {
  if (n == 1) return 1;
  static map<int, int> grundy;
  if (const auto it = grundy.find(n); it != grundy.end()) return it->second;
  set<int> st{0};
  const auto dfs = [&](auto dfs, const int cur, const int rem, const int last) -> void {
    if (rem == 0) {
      st.emplace(cur);
      return;
    }
    for (int i = min(last, rem); i >= 1; --i) {
      assert(i < n);
      dfs(dfs, cur ^ g(i), rem - i, i);
    }
  };
  dfs(dfs, 0, n, n - 1);
  int tmp = 0;
  while (st.contains(tmp)) ++tmp;
  return grundy[n] = tmp;
}

int main() {
  int t; cin >> t;
  while (t--) {
    int n; cin >> n;
    int grundy = 0;
    while (n--) {
      int a; cin >> a;
      if (a <= 2) {
        grundy ^= 1;
      } else if (a <= 4) {
        grundy ^= 2;
      } else {
        grundy ^= (a - 2) / 3 * 4 + (a % 3 == 1 ? 2 : 0);
      }
    }
    cout << (grundy == 0 ? "Bob\n" : "Alice\n");
  }
  return 0;
}