#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
vector<int> experiment() {
  int M = 40;
  vector<int> g(M);
  for (int i = 1; i < M; i++) {
    vector<vector<int>> cand;
    for (int s = 2; s <= i; s++) {
      // cerr << i << " " << s << endl;
      vector<int> tmp;
      auto dfs = [&](auto&& self, int d, int ps, int rs) -> void {
        if (d == s) {
          if (rs == 0) {
            cand.push_back(tmp);
          }
          return;
        }
        for (int i = 1; i <= ps; i++) {
          tmp.push_back(i);
          if (s - d - 1 <= rs - i) {
            self(self, d + 1, i, rs - i);
          }
          tmp.pop_back();
        }
      };
      dfs(dfs, 0, i, i);
    }
    set<int> st;
    for (int j = 0; j < i; j++) {
      st.insert(j);
    }
    st.insert(INF);
    for (auto v : cand) {
      int sg = 0;
      for (auto e : v) {
        sg ^= g[e];
      }
      st.insert(sg);
    }
    for (int j = 0; auto x : st) {
      if (j != x) {
        g[i] = j;
        break;
      }
      j++;
    }
    // if (i - 1 >= 0 and g[i - 1] != g[i]) cerr << endl;
  }
  return g;
}

int main() {
  auto naive = experiment();
  vector<int> v1 = { 0, 1, 2, 4, 4, 7, 8, 8, 11, 13, 14 };
  vector<int> v2 = { 0, 0, 3, 5, 6, 8, 10, 12, 14 };
  assert(v1.size() == 11);
  assert(v2.size() == 9);
  auto g = [&](int x) -> int {
    if (x <= 10) return v1[x];
    x -= 11;
    return (x / 9 + 1) * 16 + v2[x % 9];
  };
  vector<int> fast;
  for (int i = 0; i < 40; i++) {
    fast.emplace_back(g(i));
  }
  // for (int i = 0; i < 40; i++) {
  //   cerr << naive[i] << " ";
  // }
  // cerr << endl;
  // for (int i = 0; i < 40; i++) {
  //   cerr << fast[i] << " ";
  // }
  // cerr << endl;
  assert(naive == fast);
  int t; cin >> t;
  while (t--) {
    int sg = 0;
    int n; cin >> n;
    for (int i = 0; i < n; i++) {
      int a; cin >> a;
      sg ^= g(a);
    }
    if (sg == 0) cout << "Bob" << endl;
    else cout << "Alice" << endl;
  }
}