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();
        char[] arr = s.toCharArray();

        for (int i=0; i<s.length(); i++) {
            if (i%2==0) {
                if (arr[i]!='h') {
                    System.out.print("No");
                    return;
                }
            }else {
                if (arr[i]!='i') {
                    System.out.print("No");
                    return;
                }
            }
        }

        if (arr[s.length()-1]=='h') {
            System.out.print("No");
            return;
        }

        System.out.print("Yes");
    }

}

