Problem Statement

$O$ and $X$ are playing a game on a $1\times N$ grid. The game starts with $O$'s turn and proceeds as follows.

1. $O$ chooses one cell in which no symbol has been written yet, and writes the symbol "o" in it.
2. $X$ chooses one cell in which no symbol has been written yet, and writes the symbol "x" in it.
3. Repeat 1 and 2 until symbols have been written in all cells.

This game has progressed partway, and the board in progress is given as a string $S$. It is now $O$'s turn. Determine who wins when both players play optimally.

$T$ boards are given, so make the determination for each of them.

Input

$T$
$N_1 \ S_1$
$N_2 \ S_2$
$\vdots$
$N_T \ S_T$

• $T$ is a positive integer satisfying $1\leqq T\leqq 100$.
• $N_i$ is a positive integer satisfying $1\leqq N_i\leqq 1000$.
• $S_i$ is a string of length $N_i$ consisting of the characters o, x, -. o and x represent the symbols written in those cells so far, and - represents a cell in which no symbol has been written yet.
• It is guaranteed that $S_i$ contains the same number of o and x (hence it is $O$'s turn next).

Output

On the $i$-th line, output the name of the winner (O or X) for the board $S_i$.
Print a newline at the end.

Sample

7
10 xxoo--xxoo
10 oo-ooxxxx-
10 ooxxo--oxx
10 xooo--xx--
6 oooxxx
6 oxoxox
1 -

O
O
X
O
O
X
X