#include<map>

#include<set>

#include<cmath>

#include<queue>

#include<stack>

#include<vector>

#include<cstdio>

#include<cassert>

#include<iomanip>

#include<cstdlib>

#include<cstring>

#include<iostream>

#include<algorithm>

#define pi acos(-1)

#define ll long long

#define mod 1000000007

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

const double g=10.0,eps=1e-;

const int N=+,maxn=,inf=;

int f[N],sg[N],Hash[N];//f是可以取走的石子书

void getsg(int n)

{

    memset(Hash,,sizeof Hash);

    for(int i=;i<n;i++)

        Hash[sg[i]]=;

    for(int i=;i<=n;i++)

        for(int j=;j<=n;j++)

            if(i+j==n)

               Hash[sg[i]^sg[j]]=;

    for(int i=;;i++)

        if(!Hash[i])

        {

            sg[n]=i;

            break;

        }

    cout<<n<<" "<<sg[n]<<endl;

}

int main()

{

    ios::sync_with_stdio(false);

    cin.tie();

    for(int i=;i<=;i++)

        getsg(i);

    return ;

}

#include<map>

#include<set>

#include<cmath>

#include<queue>

#include<stack>

#include<vector>

#include<cstdio>

#include<cassert>

#include<iomanip>

#include<cstdlib>

#include<cstring>

#include<iostream>

#include<algorithm>

#define pi acos(-1)

#define ll long long

#define mod 1000000007

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

const double g=10.0,eps=1e-;

const int N=+,maxn=,inf=;

int main()

{

    ios::sync_with_stdio(false);

    cin.tie();

    int t,n,a;

    cin>>t;

    while(t--){

        cin>>n;

        int ans;

        for(int i=;i<n;i++)

        {

            cin>>a;

            if(a%==)a++;

            else if(a%==)a--;

            if(i==)ans=a;

            else ans=ans^a;

        }

        if(!ans)cout<<"Bob"<<endl;

        else cout<<"Alice"<<endl;

    }

    return ;

}