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<bits/stdc++.h>

const int N=105;

char str[N];

int main()
{
	scanf("%s",str+1);
	int n=strlen(str+1);
	if (n&1) {puts("No");return 0;}
	for (int i=1;i<n;i+=2)
		if (str[i]!='h'||str[i+1]!='i')
		{
			puts("No");
			return 0;
		}
	puts("Yes");
	return 0;
}