#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
using pii = array<int, 2>;
using vi = vector<int>;

const int N = 12;
using bs = bitset<N>;
vector<vi> dp(N + 1, vi(1 << N, -1));

int sol(int m, int n) {
    if (dp[n][m] != -1) {
        return dp[n][m];
    }
    pii cnt = {};
    for (int i = 0; i < n; ++i) {
        if (m & (1 << i)) {
            // cout << bs(m) << ' ' << bs(m >> (i + 1)) << endl;
            int ret = sol(m >> (i + 1), n - 1 - i);
            ++cnt[ret];
        } else {
            // cout << bs(m) << ' ' << bs(m & ((1 << (i + 1)) - 1)) << endl;
            int ret = sol(m & ((1 << (i + 1)) - 1), i);
            ++cnt[ret];
        }
    }

    return dp[n][m] = (cnt[0] > 0);
}

int main() {
    dp[0][0] = 0;
    for (int i = 1; i < (1 << N); ++i) {
        if (sol(i, N) == 0) {
            // cout << bs(i) << endl;
            bool cond = (i & (1 << (N - 1))) == 0 && (i & 1) && bs(i).count() * 2 == N;
            assert(cond);
        }
    }

    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        string s;
        cin >> s;
        pii cnt = {};
        for (char c : s) {
            ++cnt[c == 'L' ? 0 : 1];
        }
        bool cond = s[n - 1] == 'L' && s[0] == 'R' && cnt[0] * 2 == n;
        cout << (cond ? "Bob" : "Alice") << '\n';
    }
}