#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
#define repr(i,n) for(int i=int(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
template<class R> auto ComparingBy(R f){ return [g=std::move(f)](auto l, auto r) -> bool { return g(l) < g(r); }; }
#include <atcoder/modint>
//#include "nachia/set/enumerate-partitions.hpp"
using Modint = atcoder::static_modint<998244353>;
using namespace std;

void testcase(){
    //int N = 40;
    //auto ep = nachia::EnumeratePartitions(N);
    //vector<i64> grundy(N+1);
    //for(i64 a=1; a<=N; a++){
    //    vector<int> vis(1000);
    //    rep(i,ep[a].size()){
    //        i64 g = 0;
    //        for(auto f : ep[a][i]) g ^= grundy[f];
    //        vis[g] = 1;
    //    }
    //    int nx = 0;
    //    while(vis[nx]) nx++;
    //    grundy[a] = nx;
    //}
    //rep(i,N+1) cout << i << " : " << grundy[i] << "\n";
    //cout << endl;
    i64 T; cin >> T;
    i64 Y[] = {0,1,1,2,2};
    i64 X[] = {0,0,2};
    auto Grundy = [&](i64 a) -> i64 {
        if(a <= 4) return Y[a];
        i64 b = a - 5;
        return b/3*4 + X[b%3] + 4;
    };
    // rep(i,41) cout << Grundy(i) << endl;
    rep(t,T){
        i64 N; cin >> N;
        vector<i64> A(N); rep(i,N) cin >> A[i];
        i64 grundy = 0;
        for(auto a : A) grundy ^= Grundy(a);
        cout << (grundy != 0 ? "Alice" : "Bob") << "\n";
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}