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.Arrays;
import java.util.List;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String in = sc.nextLine();
		sc.close();
		List<String> list = Arrays.asList(in.split(""));
		int size = list.size();
		if (size % 2 != 0) {
			System.out.println("No");
			return;
		}
		for (int i = 0; i < size; i++) {
			if (i % 2 == 0) {
				if (!list.get(i).equals("h")) {
					System.out.println("No");
					return;
				}
			} else {
				if (!list.get(i).equals("i")) {
					System.out.println("No");
					return;
				}
			}
		}
		System.out.println("Yes");

	}
}
