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 s=new Scanner(System.in);
        String ss=s.next();
        int ff=0;
        for(int j=0;j<ss.length();j++){
            if(j%2==0 && ss.charAt(j)!='h'){
                ff=1;
                break;
            }
            else if(j%2==1 && ss.charAt(j)!='i'){
                ff=1;
                break;
            }
        }

        if(ff==1 || ss.length()%2==1){
            System.out.println("No");
        }
        else{
            System.out.println("Yes");
        }
    }
}
