A. Hello!
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Hello, welcome to the OIE!

The first problem we present is: given a word $$$s$$$, determine if $$$s$$$ is a permutation of the word hola.

We say that a word is a permutation (or an anagram) of another if it has the same letters regardless of the order. For example, loha, ohal, and hola are three permutations of hola, but ola, holaa, and holi are not.

Input

The first line of the input contains an integer $$$T$$$, the number of cases.

Following this, there are $$$T$$$ words formed by lowercase letters of the English alphabet, each on a new line.

Output

For each case, write a line with "SI" or "NO" (without quotes).

Scoring

$$$1 \leq T \leq 50$$$.

$$$1 \leq |s| \leq 5$$$ (the words are at most 5 letters long).

100 points: No additional restrictions.

Example
Input
6
hola
ola
ohal
loha
holaa
holi
Output
SI
NO
SI
SI
NO
NO