Problem:
Score : 100 points

Problem Statement

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.

Sample Input 1

hihi

Sample Output 1

Yes

hihi is the concatenation of two copies of hi, so it is a Hitachi string.

Sample Input 2

hi

Sample Output 2

Yes

Sample Input 3

ha

Sample Output 3

No

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		
		String str = sc.nextLine();
		
		String h = "h";
		String ii = "i";
		
		// まずstrArraySubに1文字多い配列を作る
		String[] strArray = new String[str.length()];
		 
		// 変数strの長さ分回す
		for (int i = 0; i < str.length(); i++) {
		    // strの先頭から1文字ずつString型にして取り出す
		    String str2 = String.valueOf(str.charAt(i));
		    // 配列に順番に格納する
		    strArray[i] = str2;
		}
		
		int h1 = str.indexOf(h);
//		System.out.println("h1は"+h1);
		if (h1 != -1) {
			int h2 = h1+1; 
		    if(ii.equals(strArray[h2])) {
		    	System.out.println("Yes");
		    }else {
		    	System.out.println("No");
		    }
		} else {
			System.out.println("No");
		}
		
	}
}