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.*;
import java.util.stream.Collectors;
import java.io.*;
import java.math.BigDecimal;
import java.nio.charset.StandardCharsets;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
		BufferedReader in = new BufferedReader(reader);
		Main ins = new Main(in);
		ins.calc();
		ins.showResult();
	}

	Main(BufferedReader in) throws IOException {
		String S = in.readLine();
		boolean result = false;
		if (S.length() % 2 != 0) {
			// 違う
		} else {
			int count = S.length() / 2;
			StringBuilder strBuilder = new StringBuilder();
			for(int i = 0; i < count; ++i) {
				strBuilder.append("hi");
			}
			String str = strBuilder.toString();
			if(S.equals(str)) {
				result = true;
			}
		}
		System.out.println((result ? "Yes" : "No"));
	}

	void calc() {
	}

	void showResult() {
	}

}
