#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX=1e6+5;
 
int T;
int n;
int a[MAX];
 
int st[MAX];
 
int main()
{
    int cas=0;
    for(cin>>T;T--;)
    {
        scanf("%d",&n);
        ll sum=0;
        for(int i=1;i<=n;i++)scanf("%d",a+i),sum+=a[i];
        printf("Case %d: ",++cas);
 
        if(n==1)
        {
            puts(sum%2?"Alice":"Bob");
            continue;
        }
 
        int top=0;
        for(int i=2;i<n;i++)
        {
            if(a[i-1]>a[i] && a[i]<a[i+1])st[top++]=i;
        }
 
   //     cout<<"top = "<<top<<endl;
  //      cout<<"st";for(int i=0;i<top;i++)cout<<" "<<st[i];cout<<endl;
 
 
        a[0]=-1;
        for(int i=1;i<n && a[i]<a[i+1];i++)a[i]=a[i-1]+1;
        a[n+1]=-1;
        for(int i=n;i>1 && a[i]<a[i-1];i--)a[i]=a[i+1]+1;
 
 
        for(int i=0;i<top;i++)
        {
            a[st[i]]=0;
            for(int j=st[i]+1;j<n && a[j]<a[j+1];j++)a[j]=a[j-1]+1;
            for(int j=st[i]-1;j>1 && a[j]<a[j-1];j--)a[j]=a[j+1]+1;
        }
   //     cout<<"a: ";for(int i=1;i<=n;i++)cout<<" "<<a[i];cout<<endl;
        for(int i=1;i<=n;i++)
        {
            if(i==1 && a[1]>a[2])a[1]=a[2]+1;
            else if(i==n && a[n]>a[n-1])a[n]=a[n-1]+1;
            else if(a[i-1]<a[i] && a[i]>a[i+1])
                a[i]=max(a[i-1],a[i+1])+1;
        }
   //     cout<<"a: ";for(int i=1;i<=n;i++)cout<<" "<<a[i];cout<<endl;
 
        for(int i=1;i<=n;i++)sum-=a[i];
        puts(sum%2?"Alice":"Bob");
    }
}