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

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        String[] sp = s.split("");
        boolean ans = true;
        if(sp.length % 2 == 0) {
            for(int i=0; i<sp.length-1; i+=2) {
                if(sp[i].equals("h") && sp[i+1].equals("i")) {
                    continue;
                }else {
                    ans = false;
                    break;
                }
            }
        }else {
            ans = false;
        }
        
        if(ans) System.out.println("Yes");
        else System.out.println("No");
    }
}
