use std::collections::*;
use std::io::Write;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn run() {
    input! {
        t: usize,
        ask: [(usize, bytes); t],
    }
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    for (n, s) in ask {
        let l = s.iter().filter(|s| **s == b'L').count();
        let r = s.iter().filter(|s| **s == b'R').count();
        let alice = s[0] == b'L' || s[n - 1] == b'R' || l != r;
        let ans = if alice {"Alice"} else {"Bob"};
        writeln!(out, "{}", ans).ok();
    }
}

fn main() {
    run();
    /*
    let mut map = Map::new();
    for _ in 0..10000 {
        let n = rand() % 20 + 1;
        let op = ['L', 'R'];
        let s = (0..n).map(|_| op[rand() % 100 / 50]).collect::<Vec<_>>();
        let ans = dfs(s.clone(), &mut map);
        let mut calc = false;
        calc |= s[0] == 'L';
        calc |= s[n - 1] == 'R';
    }
    */
}

fn dfs(s: Vec<char>, map: &mut Map<Vec<char>, bool>) -> bool {
    if s.is_empty() {
        return false;
    }
    if let Some(&v) = map.get(&s) {
        return v;
    }
    let ans = (0..s.len()).any(|x| {
        let mut s = s.clone();
        let c = s[x];
        if c == 'L' {
            s.drain(x..);
        } else {
            s.drain(..=x);
        }
        !dfs(s, map)
    });
    let mut t = s.clone();
    let mut calc = false;
    calc |= t[0] == 'L';
    calc |= t[t.len() - 1] == 'R';
    while t.len() >= 2 && t[(t.len() - 2)..] == ['R', 'L'] {
        t.pop();
        t.pop();
    }
    while t.len() >= 2 && [t[0], t[1]] == ['R', 'L'] {
        t.drain(..2);
    }
    let l = t.iter().filter(|t| **t == 'L').count();
    let r = t.iter().filter(|t| **t == 'R').count();
    calc |= l != r;
    if !ans && ans != calc {
        println!("{}: {}", s.iter().cloned().collect::<String>(), ans);
    }
    map.insert(s, ans);
    ans
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
fn rand_memory() -> usize {
    Box::into_raw(Box::new("I hope this is a random number")) as usize
}

fn rand() -> usize {
    static mut X: usize = 0;
    unsafe {
        if X == 0 {
            X = rand_memory();
        }
        X ^= X << 13;
        X ^= X >> 17;
        X ^= X << 5;
        X
    }
}

fn shuffle<T>(a: &mut [T]) {
    for i in 1..a.len() {
        let p = rand() % (i + 1);
        a.swap(i, p);
    }
}