/*
60 + 0 + 100 + 64 = 224.
*/

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
#define pb push_back
#define pii pair<int, int>
inline int read()
{
	int sum = 0, nega = 1;
	char ch = getchar();
	while (ch > '9'||ch < '0')
	{
	    if (ch == '-') nega = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
	return sum * nega;
}
const int N = 1e6 + 9, mod = 998244353;
inline void add(int &x, int y) {x = (x + y) % mod;}
inline void del(int &x, int y) {x = (x - y + mod) % mod;}
char s[N];
int n, T, m, a[N], cn1, b[N]; 
inline void solve() 
{
	n = read(); cn1 = 0; 
	scanf("%s", s + 1);
	if(s[1] == 'L' || s[n] == 'R') {puts("Alice"); return ;}
	L(i, 1, n) cn1 += (s[i] == 'L');
	int nw = 1; m = 0; 
	L(i, 2, n) 
	{
		if(s[i] != s[i - 1]) a[++m] = nw, nw = 1;
		else nw++; 
	}
	a[++m] = nw; 
	if(cn1 != n / 2 || n % 2 != 0) {puts("Alice"); return ;}
	L(i, 1, m / 2) b[i] = a[i * 2 - 1] - a[i * 2]; 
	int pos = 0; 
	L(i, 1, m / 2) 
		if(b[i] < 0) {pos = i; break;}  
	L(i, pos, m / 2) 
		if(b[i] > 0) {puts("Alice"); return ;}
	puts("Bob"); 
	return ;
}
signed main()
{
	T = read();
	L(i, 1, T) solve(); 
	return 0;
}