#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
void solve()
{
    int n;
    string s;
    cin >> n >> s;
    int t = count(s.begin(), s.end(), 'L');
    if (t == 0 || t == n)
    {
        cout << "Alice" << endl;
        return;
    }
    s = " " + s;
    vector<int> l(n + 2), r(n + 2), vi(n + 2), is(n + 2);
    queue<int> q;
    for (int i = 1; i <= n; i++)
    {
        l[i] = i - 1;
        r[i] = i + 1;
    }
    vi[0] = 1;
    vi[n + 1] = 1;
    for (int i = 1; i < n; i++)
    {
        if (s[i] == 'R' && s[i + 1] == 'L')
        {
            vi[i] = 1;
            vi[i + 1] = 1;
            is[i] = is[i + 1] = 1;
            l[r[i + 1]] = l[i];
            r[l[i]] = r[i + 1];
            if (!vi[l[i]])
                q.push(l[i]), vi[l[i]] = 1;
        }
    }
    while (!q.empty())
    {
        int p1 = q.front();
        q.pop();
        int p2 = r[p1];
        if (s[p1] == 'R' && s[p2] == 'L')
        {
            is[p1] = is[p2] = 1;
            l[r[p2]] = l[p1];
            r[l[p1]] = r[p2];
            if (!vi[l[p1]])
                q.push(l[p1]), vi[l[p1]] = 1;
        }
    }
    int num = accumulate(is.begin(), is.end(), 0);
    if (num == n)
    {
        cout << "Bob" << endl;
    }
    else
    {
        cout << "Alice" << endl;
    }
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
}