#include <bits/stdc++.h>

using namespace std;

#define pll pair<ll, ll>
#define mod 1000000007
#define mp make_pair
#define ll long long int
#define pb push_back
#define ppb pop_back
#define INF 1000000000000000000
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repr(i, n, a) for (ll i = n; i >= a; i--)
#define vll vector<ll>
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define F first
#define S second
#define endl "\n"

ll gcd(ll x, ll y)
{ //returns gcd of two long long ints
    if (x == 0)
        return y;
    return gcd(y % x, x);
}

ll lcm(ll x, ll y)
{
    return ((x * y) / gcd(x, y));
}

bool isPrime(ll n)
{
    // Corner case
    if (n <= 1)
        return false;

    // Check from 2 to n-1
    for (ll i = 2; i * i < n + 1; i++)
        if (n % i == 0)
            return false;

    return true;
}

//***************************** CODE STARTS HERE **************************************

ll x = 0;

bool pal(string &s)
{
    ll l = 0, r = s.size() - 1;
    while (l < r)
    {
        if (s[l] != s[r])
            x++, s[l] = '1', s[r] = '1';
        l++, r--;
    }
    return x == 0;
}

void yo()
{
    ll n;
    cin >> n;
    x = 0;
    string s;
    cin >> s;
    ll z = 0;
    pal(s);
    rep(i, 0, n) if (s[i] == '0') z++;
    if (x == 0)
    {
        if (z % 2 == 0)
            cout << "BOB" << endl;
        else if (z == 1)
            cout << "BOB" << endl;
        else
            cout << "ALICE" << endl;
        return;
    }
    if (x == 1 && z == 1)
        cout << "DRAW" << endl;
    else
        cout << "ALICE" << endl;

    return;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll t = 1;
    cin >> t;
    while (t--)
    {
        yo();
    }
    return 0;
}
