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<iostream>
#include<algorithm>
#include<cstdio>

using namespace std;

string s;

int main()
{
	cin>>s;
	
	int len=s.length();
	s+="233333";
	for (int i=0;i<len;i+=2)
	if (!(s[i]=='h' and s[i+1]=='i'))
	{
		printf("No");
		return 0;
			}	
	printf("Yes");	
} 
