#include<bits/stdc++.h>
#define fo(i,l,r) for(int i=l;i<=r;++i)
#define fd(i,r,l) for(int i=r;i>=l;--i)
#define ll long long
#define I inline int
#define V inline void
#define B inline bool
#define L inline ll
#define pi pair<int,int>
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define vii vector<pi>
using namespace std;
const int N=5010,mod=998244353;
char St;
I read() {
	int x=0,y=1;char c=getchar();
	while(c<48||c>57) {if(c==45)y=-y;c=getchar();}
	while(c>=48&&c<=57) x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*y;
}
int cnt[N],SG[N][N],n;
char c[N];
L ksm(ll x,int y) {ll t(1);for(;y;y>>=1,x=x*x%mod)if(y&1)t=t*x%mod;return t;}
V solve() {
	n=read();
	scanf("%s",c+1);
	fo(i,1,n+1) SG[i][i-1]=0;
	fo(len,1,n) {
		fo(l,1,n-len+1) {
			int r=l+len-1;
			fo(i,l,r) {
				if(c[i]=='L') cnt[SG[l][i-1]]++;
				else cnt[SG[i+1][r]]++;
			}
			SG[l][r]=0;
			while(cnt[SG[l][r]]) SG[l][r]++;
			SG[l][r]=SG[l][r]>0;
			fo(i,l,r) {
				if(c[i]=='L') cnt[SG[l][i-1]]--;
				else cnt[SG[i+1][r]]--;
			}
//			printf("%d %d : %d\n",l,r,SG[l][r]);
		}
	}
	if(SG[1][n]) puts("Alice");
	else puts("Bob");
}
char Ed;
int main() {
	cerr<<"memory:"<<(&St-&Ed)/1024.0<<endl;
	int T=read();
	while(T--) solve();
	cerr<<"time:"<<clock()<<endl;
	return 0;
}