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.io.*;
import java.util.*;

class Main {
	static final String YES = "Yes";
	static final String NO = "No";

	public static void main(String[] args) throws Exception {
		final Scanner sc = new Scanner(System.in);
		char[] S = sc.next().toCharArray();
		if (S.length % 2 == 1) {
			System.out.println(NO);
			return;
		}

		for (int i = 0; i < S.length; i++) {
			if (i % 2 == 0 && S[i] != 'h') {
				System.out.println(NO);
				return;
			}

			if (i % 2 == 1 && S[i] != 'i') {
				System.out.println(NO);
				return;
			}
		}

		System.out.println(YES);
	}
}
