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
#include <stdio.h>
#include <algorithm>
using namespace std;
using ll = long long;

char s[20];
int main() {
	scanf("%s", s);
	bool v = true;
	for (int i = 0; s[i]; i += 2) {
		v &= s[i] == 'h';
		v &= s[i + 1] == 'i';
	}
	printf(v ? "Yes\n" : "No\n");
}