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.next();
    String[] st = new String[5];
    st[0] = "hi";
    for(int i = 1; i < 5; i++) {
      st[i] = st[i - 1] + "hi";
    }
    String ans = "No";
    for(int i = 0; i < 5; i++) {
      if(s.equals(st[i])) ans = "Yes";
    }
    System.out.println(ans);
  }
}