Given a string consisting of spaces,\t,\n and lower case  alphabets.Your task is to count the number of words where spaces,\t and \n work as separators.

Input:
The first line of input contains an integer T denoting the number of test cases.Each test case consist of a string.

Output:
Print the number of words present in the string.

Constraints:
1<=T<=100

Example:
Input:
2
abc\t\ndef   ghi
one   two   three  \t  four
Output:
3
4