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

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String[] input = scanner.nextLine().split("");
        if(!(input.length%2==0)){
            System.out.println("No");
            return;
        }
        boolean hiString = true;
        for(int x =0; x<input.length-1; x+=2){
            if(!(input[x].equals("h") && input[x+1].equals("i"))){
                hiString = false;
                break;
            }
        }
        System.out.println(hiString?"Yes":"No");

    }

}
