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

public class Main {

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

		String string = sc.nextLine();

		String regex = "hi";
		Pattern pt =Pattern.compile(regex);
		Matcher matcher = null;

		if (string.length() < 2 || string.length() % 2 == 1) {
			System.out.println("No");
		}else {
			for (int i = 0; i < string.length(); i+=2) {
				matcher = pt.matcher(string.substring(i, i + 2));
				if (matcher.find() == false) {
					System.out.println("No");
					break;
				}
				if (i == string.length() - 2) {
					System.out.println("Yes");
				}
			}
		}
	}
}