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

class Main{
public static void main(String[] args){
	Scanner sc=new Scanner(System.in);
        String s=sc.next();
  		String[] a=s.split("");
  		int ans=0;
  		int c=0;
  
		while(c<a.length){
        	if(a[c].equals("h")){
            	c=c+2;
            }else{
            	ans++;
              	c=c+2;
            }
          
        }
  		c=1;
  
  		while(c<a.length){
        	if(a[c].equals("i")){
            	c=c+2;
            }else{
            	ans++;
              	c=c+2;
            }
          
        }
  	if(a.length%2==1){
    	ans++;
    }
    
    
 	if(ans==0){
    		System.out.println("Yes");
    	}else{
     		System.out.println("No");
   	 }

    	
    }
}
