The niceness of a string s (s comprises of a-z, A-Z and space characters only) is calculated using steps given below.

1. First separate out the string into continuous non zero length string without space. eg. Let us take s = "now do it now". You can break this into four small strings as "now", "do", "it" and "now". Call the set of these small strings to be G.
2. Now reverse all the strings in G. eg. "won", "od", "ti", "won".
3. Finally you calculate number of distinct strings in you set. in this case answer is 3. as "won", "od" and "ti" are set of distinct strings. Note that "won" comes twice but counted only once.

So you have to find niceness value of a string s.

Note that given string s can contain more than one continuous spaces. eg. "now do it now ". Niceness value of this is also same as above given example.

Input

T: number of test cases. (T ≤ 100)

for next T lines, every line contains one string s (1 ≤ |s| ≤ 10⁴)

Output

For every test case, output niceness value of given string s.

Example

Input:
4
now do it now
now      do it now
I am  good boy
am am

Output:
3
3
4
1