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>
using namespace std;
int main()
{
string s;
cin>>s;
int fn(0);
for(int i=0; i<s.length(); ++i)
{
if((s[i]!='h'&&i%2==0)||(s[i]!='i'&&i%2))
{
fn=1;
break;
}
}
if(fn==0&&s.length()%2==0)
cout<<"Yes";
else
cout<<"No";
}