문제

Because Bessie is bored of playing with her usual text string where the only characters are 'C,' 'O,' and 'W,' Farmer John gave her $Q$ new strings ($1 \leq Q \leq 100$), where the only characters are 'M' and 'O.' Bessie's favorite word out of the characters 'M' and 'O' is obviously "MOO," so she wants to turn each of the $Q$ strings into "MOO" using the following operations:

Replace either the first or last character with its opposite (so that 'M' becomes 'O' and 'O' becomes 'M'). Delete either the first or last character.

Unfortunately, Bessie is lazy and does not want to perform more operations than absolutely necessary. For each string, please help her determine the minimum number of operations necessary to form "MOO" or output $-1$ if this is impossible.

입력

The first line of input contains the value of $Q$.

The next $Q$ lines of input each consist of a string, each of its characters either 'M' or 'O'. Each string has at least 1 and at most 100 characters.

출력

Output the answer for each input string on a separate line.

예제 입력 1

3
MOMMOM
MMO
MOO

예제 출력 1

4
-1
0

점수

Inputs 2-4: Every string has length at most $3$.Inputs 5-11: No additional constraints.