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) {
    	Scanner sc = new Scanner(System.in);
    	String N = sc.next();
    	boolean hi = true;
    	for (int i = 0; i < N.length(); i++) {
    		if ((i%2 == 0 && N.charAt(i) != 'h') || (i%2 == 1 && N.charAt(i) != 'i')) {
    			hi = false;
    		} 
    	}
    	System.out.println(hi && N.length()%2 ==0 ? "Yes" : "No");
    }
}