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[]) {
        Scanner sc = new Scanner(System.in);
        String[] s = sc.next().split("");
        for(int i=0;i<s.length;i++){
            if(i%2==0){
                if(!s[i].equals("h")){
                    System.out.println("No");
                    return;
                }
            }
            else{
                if(!s[i].equals("i")){
                    System.out.println("No");
                    return;
                }
            }
        }
        if(s.length==1 || s.length%2==1){
            System.out.println("No");   
            return; 
        }
        System.out.println("Yes");
    }
}
