Given a word or phrase, check if it is isogram or not. An Isogram is a word in which no letter occurs more than once.
The first line of input contains an integer T denoting the number of test cases. Each test case consist of one strings in 'lowercase' only, in a separate line.
Print 1 if string is Isogram else print 0.
1 <= T <= 100
1 <= |S| <= 100
For testcase 2: geeks is not an isogram as 'e' appears twice. Hence we print 0.