#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001
map<long long,long long> mp;
long long check(long long n){
	if(mp.count(n))return mp[n];
	if(n==0)return 0;
	set<long long> S;
	
	rep(i,1<<(n-1)){
		vector<long long> t(1,1);
		rep(j,n-1){
			if((i>>j)&1)t.push_back(1);
			else t.back()++;
		}
		if(t.size()==1)continue;
		long long xo = 0;
		rep(j,t.size())xo^=check(t[j]);
		S.insert(xo);
	}
	S.insert(0);
	long long ret;
	rep(i,1000){
		if(!S.count(i)){
			ret = i;
			break;
		}
	}
	mp[n] = ret;
	return ret;
	
}

long long get(long long n){
	vector<long long> ret = {0,1,2,2,4,4};
	if(n<ret.size())return ret[n];
	long long t = ((n+2)/3)*4-6;
	if(n%3!=1)t += 2;
	return t;
}

int main(){

	/*rep(i,22){
		cout<<i<<' '<<check(i)<<' '<<get(i)<<endl;
	}
	*/
int _t;
cin>>_t;
rep(_,_t){
	int n;
	cin>>n;
	long long xo = 0;
	rep(i,n){
		long long a;
		cin>>a;
		xo ^= get(a);
		
	}
	if(xo==0)cout<<"Bob"<<endl;
	else cout<<"Alice"<<endl;
}	
	
	return 0;
}