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
import java.io.*;
import java.util.*;

public class Main {
	public static void main (String[] args) {
	Scanner s=new Scanner(System.in);	
	String c=s.next();
	int n=c.length();
	boolean flag=true;
	if(n%2==1)
	flag=false;
	else
	{for(int i=0;i<n;i+=2)
	{if(c.substring(i,i+2).equals("hi"))
	{}
	else
	{flag=false;
	break;
	}}}
	if(flag)
	System.out.println("Yes");
	else
	System.out.println("No");
	}}