A Hitachi string is a concatenation of one or more copies of the string `hi`.

For example, `hi` and `hihi` are Hitachi strings, while `ha` and `hii` are not.

Given a string S, determine whether S is a Hitachi string.

Constraints

* The length of S is between 1 and 10 (inclusive).
* S is a string consisting of lowercase English letters.

Input

Input is given from Standard Input in the following format:


S


Output

If S is a Hitachi string, print `Yes`; otherwise, print `No`.

Examples

Input

hihi


Output

Yes


Input

hi


Output

Yes


Input

ha


Output

No
import java.util.*;
class Main
{
public static void main(String args[])
{
int i=0,j=0,flag=0,s;
char a[]={'h','i'};
Scanner inn=new Scanner(System.in);
String v =inn.next();
s=v.length();
if(s%2!=0)
System.out.println("No");
else
{
for(j=0;j<s;j++)
{
i=i%2;
if(v.charAt(j)!=a[i])
{

flag=1;
break;
}
i++;
}
if(flag==0)
System.out.println("Yes");
else
System.out.println("No");
}
}
}
