#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fir first
#define sec second
#define ll long long
using namespace std;
const int N=1e6+10;
int T,n;
string s;
map <pair<string,bool>,bool> f;
bool dfs(string s,bool op){
	if(f.count(mp(s,op)))return f[mp(s,op)];
	if(!s.size())return op;
	for(int i=0;i<s.size();i++){
		bool now=0;
		//cerr<<s<<" "<<i<<" "<<op<<endl;
		if(s[i]=='L'){
			now=dfs(s.substr(0,i),op^1);
		}else{
			now=dfs(s.substr(i+1,s.size()-i-1),op^1);
		}
		if(now!=op)return f[mp(s,op)]=now;
	}
	return f[mp(s,op)]=op;
}
void solve(){
	cin>>n>>s;
	if(dfs(s,0))cout<<"Alice\n";
	else cout<<"Bob\n";
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>T;
	while(T--)solve();
	return 0;
}