Alice and Bob are sitting at a long table with a row of N berries. Each berry is either a Blueberry (B) or a Raspberry (R). They decide to play a game with the following rules:

• Alice always goes first.
• In a single turn, a player must choose one or more berries to eat.
• All berries chosen in a single turn must be of the same type (all B or all R).
• All berries chosen must be consecutive and taken from the right end of the row.

The player who eats the last berry wins the game. Assuming both Alice and Bob play optimally to win, determine who will win the game.

The first line contains an integer T (1 \le T \le 10^3), the number of test cases. For each test case: An integer N (1 \le N \le 10^5), the number of berries. A string S of length N consisting of characters 'B' and 'R', representing the row of berries from left to right.

For each test case, on separate lines output "Alice" if the first player wins, or "Bob" otherwise.