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

class Main {

	public static void main(String[] args) throws Exception{
		        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		        String tests = br.readLine();
				if(tests.length()%2!=0){
		          System.out.println("No");
		        } else{
		          
		            int i=0;
		            while(i<tests.length()){
		              String temp=tests.substring(i,i+2);
		              if(!temp.equals("hi")){
		                break;
		              }
		              i=i+2;
		            }
		            if(i>=tests.length()){
		               System.out.println("Yes");
		            } else {
		            
		     
		            System.out.println("No");
		            }
		          
		          
		        }
		                             
		    }

}
