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.Scanner;
public class Main {

    public static void main(String[] args) {
        Scanner stdIn = new Scanner(System.in);

        String hitachi = stdIn.next();
        //System.out.println(hitachi);

        //String hitachi = "";
//        if (args == null || args.length != 1) {
//            System.out.println("No");
//            System.exit(0);
//        }else {
            //hitachi = args[0];
            if(hitachi.length() > 10 || hitachi.length() == 0) {
                System.out.println("No");
                //System.exit(0);
                return;
            }
            if(!hitachi.matches("[a-z]*")) {
                System.out.println("No");
                System.exit(0);
            }
            if(hitachi.contains(" ")) {
                System.out.println("No");
                System.exit(0);
            }

            do {
                //System.out.println("[" + hitachi + "]");

                if (hitachi.startsWith("hi")) {
                    //hitachi = hitachi.substring(2, hitachi.length() - 1);
                    hitachi = hitachi.substring(2);
                    //System.out.println("substring = [" + hitachi + "]");
                } else {
                    System.out.println("No");
                    System.exit(0);
                }
            } while (hitachi.length() > 0);
            System.out.println("Yes");
        //}
    }

}
