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) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		String ans = "Yes";
		char[] c = new char[s.length()];

		for(int i=0; i<s.length(); i++) {
			c[i] = s.charAt(i);
		}

		if(s.length() % 2 != 0)
			ans = "No";
		else {
			for(int i=0; i<s.length(); i+=2) {
				if(c[i] != 'h' || c[i+1] != 'i') {
					ans = "No";
					break;
				}
			}
		}

		System.out.println(ans);
	}

}
