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.
The first line of input contains an integer T denoting the number of test cases.Each test case consist of a string.
Print the number of words present in the string.
one two three \t four
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.