// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <random>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;

#define PB emplace_back
// #define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 1e6;
int T, a, t[N + 5], b, s[N + 5];
char c[N + 5];

bool calc() {
	if(b & 1) return 1;
	int lst = -1, c = 0;
	for(int i = 1; i <= b; i += 2) {
		if(t[i] == t[i + 1]) continue;
		int o = t[i] > t[i + 1];
		if(i == 1 && !o) return 1;
		if(o == lst) s[c] += abs(t[i] - t[i + 1]);
		else s[++c] = abs(t[i] - t[i + 1]);
		lst = o;
	}
	if(!c) return 0;
	if(lst == 1) return 1;
	// cout << b << endl;
	b = c;
	rep(i, 1, c) t[i] = s[i];
	return calc();
}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	for(cin >> T; T--; ) {
		cin >> a >> c + 1;
		if(c[1] != 'R' || c[a] != 'L') cout << "Alice\n";
		else {
			b = 0;
			rep(i, 1, a) {
				if(c[i] != c[i - 1]) t[++b] = 1;
				else ++t[b];
			}
			calc() ? cout << "Alice\n" : cout << "Bob\n";
		}
	}
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}