#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define int long long int
#define pii pair<int,int>
const int INF= 1e15;
const int MAX=1e5+5;
const int MAXK=20;
const int mod = 1e9+7;
int gcd(int a, int b)
{
    while(b!=0)
    {
        a=a%b;
        swap(a,b);
    }
    return a;
}
int binpow(int a,int b)
{
    int res=1;
    while(b>0)
    {
        if(b%2==1)
            res=res*a%mod;
        a=a*a%mod;
        b/=2;
    }
    return res%mod;
}
int dp[505][505][2][2];//cnt ->00, cnt->01,10 , mid->0,1, rev->0,1
void check()
{
    dp[0][0][0][0]=0;
    dp[0][0][0][0]=1;
    for(int i=0;i<=500;i++)
    {
        for(int j=0;j<=500;j++)
        {
            for(int k=0;k<=1;k++)
            {
                for(int l=1;l>=0;l--)
                {
                    dp[i][j][k][l]=INF;
                }
            }
        }
    }
    dp[0][0][0][0]=0;
    dp[0][0][0][1]=0;
    for(int i=0;i<=500;i++)
    {
        for(int j=0;j<=500;j++)
        {
            for(int k=0;k<=1;k++)
            {
                for(int l=1;l>=0;l--)
                {
                    if(l==0&&j>0)
                    {
                        dp[i][j][k][l]=min(dp[i][j][k][l],-dp[i][j][k][1]);
                    }
                    if(i>0)
                    {
                        dp[i][j][k][l]=min(dp[i][j][k][l],1-dp[i-1][j+1][k][0]);
                    }
                    if(j>0)
                    {
                        dp[i][j][k][l]=min(dp[i][j][k][l],1-dp[i][j-1][k][0]);
                    }
                    if(k==1)
                    {
                        dp[i][j][k][l]=min(dp[i][j][k][l],1-dp[i][j][0][0]);
                    }
                }
            }
        }
    }
}
void solve()
{
    int n;
    string s;
    cin>>n>>s;
    int zero=0,one=0,mid=0;
    for(int i=0;i<n/2;i++)
    {
        if(s[i]=='0'&&s[i]==s[n-1-i])
        {
            zero++;
        }
        else if(s[i]!=s[n-1-i])
            one++;
    }
    if(n%2)
    {
        if(s[n/2]=='0')
            mid=1;
    }
    if(dp[zero][one][mid][0]<0)
    {
        cout<<"ALICE\n";
    }
    if(dp[zero][one][mid][0]>0)
    {
        cout<<"BOB\n";
    }
    if(dp[zero][one][mid][0]==0)
    {
        cout<<"DRAW\n";
    }


}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
#ifndef ONLINE_JUDGE
   freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
#endif // ONLINE_JUDGE
    int t=1;
    cin>>t;
    check();
    for(int i=1;i<=t;i++)
    {
        //cout<<"Case #"<<i<<": ";
        solve();
    }
}