#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5; 

int n; 
char a[N]; 

void solve(void) {
    cin >> n >> a + 1; 
    int m = 0; 
    for (int i = 1; i <= n; ++i)
        if (m <= 1 || (a[i] != a[m - 1] || a[i] != a[m])) a[++m] = a[i]; 
    n = m; 
    // a[1] == L or a[n] == R
    for (int i = 1; i <= n; ++i) cout << a[i]; cout << '\n'; 
    int l = 1, r = n, now = 0; 
    while (1) {
        if (l == r || a[l] == 'L' || a[r] == 'R') {
            cout << (now ? "Bob\n" : "Alice\n"); 
            break; 
        }
        if (a[l + 1] == 'R') ++l; 
        else if (a[r - 1] == 'L') --r; 
        else ++l; 
        now ^= 1; 
    }
}

int main(void) {
    ios::sync_with_stdio(0); 
    int T = 1; cin >> T; 
    while (T--) solve();
    return 0;
}