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.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String hi = scanner.next();
        Matcher m = Pattern.compile("[\\s\\S]{1,2}").matcher(hi);
        boolean a = true;
        while (m.find()) {
            if (!m.group().equals("hi")) {
                a = false;
                break;
            }
        }
        if (a) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}