ABB to BA (Easy)

This is the easy version of "ABB to BA". The two versions are identical except for the limits on $t$ and $n$.

A string $S$ consisting only of 'A' and 'B' is given. Repeat the following operation until it can no longer be performed.

• Let $i$ be the smallest position where the substring "ABB" first appears in $S$. Replace the substring "ABB" at that position with "BA".
• In other words, find the smallest $i$ such that $S_i S_{i+1} S_{i+2}$ is "ABB". Replace $S_i$ with 'B', replace $S_{i+1}$ with 'A', and delete $S_{i+2}$ from $S$.
• If $S$ does not contain "ABB" as a substring, the operation cannot be performed.

Write a program that prints the contents of $S$ after the repetitions end.

The first line contains the number of test cases $t$. ($1 \le t \le 300$)

Each test case consists of two lines.

• The first line contains the length $n$ of $S$. ($1 \le n \le 2\cdot 10^3$)
• The second line contains the string $S$ of length $n$. (Every $S_i$ is 'A' or 'B')

The sum of $n$ over all test cases does not exceed $2\cdot 10^3$.

For each test case, print the contents of $S$ after the repetitions end, on one line.