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;
using ll=long long;

string S;

int main(){
	cin>>S;
	if(S.size()&1){
		puts("No");
	}
	else{
		for(int i=0;i<S.size();i+=2){
			if(S[i]!='h'||S[i+1]!='i'){
				puts("No");
				return 0;
			}
		}
		puts("Yes");
	}
}
