Cute String Merging

View as PDF

Points: 15 (partial)
Time limit: 2.0s
Memory limit: 256M

Author:
Problem type

Marcus loves strings, especially cute strings and ones consisting of the letters a, b, and c. He recently received such a string (which we'll call ), and to make it as cute as possible he will perform zero or more merge operations on it to make it shorter (Marcus thinks short strings are very cute).

A merge operation is defined as follows:

Let be the current state of Marcus's string (its length is denoted as ).

• Select an index such that .
• Remove the letters and and replace them with the letter that is neither one of those two out of a, b, and c (i.e. if you removed the letters a and b you would replace them with the letter c).

Marcus managed to shorten his string quite a bit, but he wants you to verify his answer by helping him find the shortest length he can make his string after some number (possibly zero) of merge operations.

Lastly, to ensure the integrity of your solution, each input file will contain separate test cases.

Constraints

will only contain the letters a, b, and c.

The sum of over all test cases will be at most .

The sum of over all test cases will be at most .

The sum of over all test cases will be at most .

Input Specification

The first line will contain , the number of test cases. cases then follow.

Each case consists of a single line, the string in that test.

Output Specification

For each test case, output the shortest length that can reach after some number of merge operations.

Sample Input

3
abcabc
cccc
ab

Sample Output

2
4
1

Explanation

Here is an example sequence of merge operations in the first test case that yields an optimal answer (the portion in brackets denotes the indices being merged):

• ab[ca]bc -> abbbc
• abb[bc] -> abba
• ab[ba] -> abc
• a[bc] -> aa
• aa

In the second case, no merge operations are possible so the answer is simply the length of the string.

In the last test case, ab can be merged into c.