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.Scanner;

public class Main{
    public static void main(String[]args){
        Scanner scan = new Scanner(System.in);
        String s;
        int flag;
        flag=0;
        s=scan.next();
        for(int i=0;i<s.length()-1;i+=2){
            if(s.charAt(i)=='h'&&s.charAt(i+1)=='i'){
                flag=1;
            }
            else{
                flag=0;
                break;
            }
        }
        if(s.equals("h")||s.equals("i")) System.out.println("No");
        else if(s.length()%2==1) System.out.println("No");
        else if(flag==1) System.out.println("Yes");
        else System.out.println("No");
    }
}