Maximizing Blooms

You are given an integer \(T\) representing the number of test cases. For each test case, you are given a string \(S\) consisting of characters 'F' and 'W'. Each character represents a flower: 'F' indicates a fully bloomed flower, while 'W' indicates a wilted flower.

Since you have the freedom to flip the state of any flower, the maximum number of fully bloomed flowers you can achieve is equal to the total number of flowers, i.e. \(|S|\) for each test case.

Your task is to compute and output the maximum number of fully bloomed flowers for each test case.

Note: The input is read from standard input and the output should be written to standard output.

inputFormat

The first line of input contains an integer \(T\) representing the number of test cases.

Each of the following \(T\) lines contains a non-empty string \(S\) composed solely of the characters 'F' and 'W'.

You can assume that \(1 \le T \le 1000\) and \(1 \le |S| \le 10^5\).

outputFormat

For each test case, output a single line containing the maximum number of fully bloomed flowers possible, which is \(|S|\).

## sample

1
FFF

3

</p>