**Compilation/Execution Result:**

36.14%

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.

**Input:**

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.

**Output:**

Print 1 if string is Isogram else print 0.

**Constraints:**

1 <= T <= 100

1 <= |S| <= 100

**Example:**

**Input:**

2

machine

geeks

**Output:**

1

0

**Explanation:**

For testcase 2: geeks is not an isogram as 'e' appears twice. Hence we print 0.

Author: anuj0503

Pulkit Gupta 2 | 130 |

Relentless | 124 |

Ibrahim Nash | 94 |

nancygarg258_pec | 90 |

darkswordsman | 90 |

Ibrahim Nash | 602 |

KartikAgarwal | 541 |

rs119574 | 371 |

surbhi_7 | 356 |

Little Noah | 335 |

akhayrutdinov | 4261 |

sanjay05 | 3633 |

Ibrahim Nash | 3162 |

Quandray | 3028 |

Michael Riegger | 2359 |