#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while(t--) {
        int n;
        string s;
        cin >> n >> s;
        vector<pair<char,int>>tmp;
        for(int i = 1; i < n; i++) {
            if(s[i-1] != s[i]) continue;
            if(tmp.empty() || tmp.back().first != s[i]) {
                tmp.push_back({s[i],0});
            }
            else {
                tmp.back().second++;
            }
        }
        bool f = false;
        if(s[0] == 'L' || s[n-1] == 'R') f = true;
        while(!tmp.empty()) {
            if(tmp.front().first == 'L' || tmp.back().first == 'R') {
                f = true;
                break;
            }
            vector<pair<char,int>>res;
            for(int i = 0; i < tmp.size(); i++) {
                if(tmp[i].second >= 2) {
                    if(!res.empty() && res.back().first == tmp[i].first) {
                        res.back().second += tmp[i].second-1;
                        continue;
                    }
                    res.push_back({tmp[i].first,tmp[i].second-1});
                }
            }
            tmp = res;
        }
        cout << ((f)?"Alice":"Bob") << "\n";
    }
}