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 C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
int main()
{
	std::string str;
	cin >> str;
	int length = str.length();
	if (length > 1) {
		for (int i = 0; i < length - 1; i++) {
			if (str[i] == 'h' && str[i + 1] == 'i') {
				cout << "Yes" << endl;
				return 0;
			}
		}
	}

	//int x = 100 * a / 108;
	//int y = 100 * b / 110;

	cout << "No" << endl;
	return 0;
}