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

class Main{
  public static void main(String[] a){
    Scanner sc = new Scanner(System.in);
    String s = sc.next();
    
    if(s.length()%2==1){
      System.out.print("No");
      return;
    }
    
    for(int i=0;i<s.length();i=i+2){
      if(s.charAt(i) != 'h'){
        System.out.print("No");
        return;
      }
      if(s.charAt(i+1) != 'i'){
          System.out.print("No");
          return;
      }
    }
    System.out.print("Yes");
  }
}