#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for(long long i=0;i<n;++i)
#define rep1(i,n) for(long long i=1;i<=n;++i)
#define rrep(i,n) for(long long i=n-1;i>=0;--i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1.1e18;const lint inf=1.01e9;
constexpr int MOD=1000000007;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return 1; } return 0; }
void solve(){
  int n;cin>>n;
  vector<lint> a(n);
  rep(i,n)cin>>a[i];
  int sm=0;
  rep(i,n)sm=sm^a[i];
  if((n%2==0&&sm>0)||(n%2==1&&sm>0))cout<<"Alice"<<"\n";
  else cout<<"Bob"<<"\n";
}
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int t;cin>>t;
  rep(i,t)solve();
  return 0;
}