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 S = sc.nextLine();
      	if (YesNo(S)) {
          Yes();
        } else {
          No();
        }
    }
  	public static boolean YesNo(String S) {
      if ((S.length() % 2) != 0) {
        return false;
      }
      for (int i = 0; i < S.length(); i += 2 ) {
        if (S.substring(i,i+1).equals("h") && S.substring(i+1,i+2).equals("i")) {
          continue;
        }
        return false;
      }
      return true;
    }
    public static void Yes() {
      	System.out.println("Yes");
    }
	public static void No() {
		System.out.println("No");
    }
}