Shortest Legal String

This problem asks you to determine the length of the shortest legal string that can be obtained after repeatedly performing a given operation on a string. Although the details of the operation are not described explicitly, it can be shown that any string can always be reduced to a single character. In mathematical terms, for any input string, the minimum achievable length is \(L = 1\).

You will be given T test cases. For each test case, a string is provided, and you are required to output the number 1, which represents the length of the shortest possible string obtainable by applying the operation any number of times.

Example: If the input string is "abrac", the answer is 1 because the string can always be reduced to a single character.

inputFormat

The first line of the input contains an integer T (\(1 \le T \le 1000\)), the number of test cases. Each of the following T lines contains a non-empty string consisting of lowercase letters. The length of each string will be at least 1 and can be large.

outputFormat

For each test case, output a single integer on a separate line representing the length of the shortest possible string that can be obtained through the allowed operations. Since any string can be reduced to a single character, the expected output for every test case is 1.

## sample

1
abrac

1

</p>