Description

As a law-abiding Luogu user, we support only authentic contests.

You are given $T$ contest names (strings containing only letters and digits), which may not follow standard naming conventions. You can perform a swap between any two characters per operation. Your goal is to eliminate any case where both substrings LGR and CSP coexist in the same string.

For example, LGRCSP can be transformed in one move to LGRSCP.

Output the minimum number of operations required to eliminate this conflict.

Input Format

The first line contains a single integer $T$, the number of test cases.

Each of the next $T$ lines contains one string $s$, the contest name.

Output Format

For each test case, output a single integer — the minimum number of swaps required.

3
LGR201Div3CSP2024dierlunmoni
QAQ
LGRLGR114514Div2CSPCSP2025dierlunmoni

1
0
1

Hint

Subtasks are used in this problem.

Let $t$ be the length of string $s$.

For all test cases, it is guaranteed that $1\le T \le 10$, $1 \le t \le 10^5$.