import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


long calc(long a) {
  if (a < 7) return [0, 1, 1, 2, 2, 4, 4][a];
  const q = (a - 7) / 3;
  const r = (a - 7) % 3;
  return 6 + q * 4 + (r ? 2 : 0);
}

void main() {
  debug {{
    enum LIM = 2^^6;
    auto gs = new int[LIM];
    auto dp = new bool[][](LIM, LIM);
    dp[0][0] = true;
    foreach (n; 1 .. LIM) {
      foreach (dn; 1 .. n) foreach (x; 0 .. LIM) if (dp[n - dn][x]) {
        dp[n][x ^ gs[dn]] = true;
      }
      foreach (x; 1 .. LIM) if (!dp[n][x]) {
        gs[n] = x;
        break;
      }
      dp[n][gs[n]] = true;
    }
    writeln("gs = ", gs);
    foreach (n; 2 .. LIM - 1) {
      if (gs[n - 1] < gs[n] && gs[n] < gs[n + 1]) {
        write(n, " ");
      }
    }
    writeln;
    foreach (n; 0 .. LIM/2) {
      assert(gs[n] == calc(n));
    }
  }}
  
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readInt;
        auto A = new long[N];
        foreach (i; 0 .. N) {
          A[i] = readLong;
        }
        
        long x;
        foreach (a; A) x ^= calc(a);
        writeln(x ? "Alice" : "Bob");
      }
    }
  } catch (EOFException e) {
  }
}