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<bits/stdc++.h>
#include<string.h>
#include<vector>
using namespace std;
#define MAX 30
#define MOD 998244353
char s[MAX];
int main()
{
    int n,i,j;
    for(i=0;;i++)
    {
        scanf("%c",&s[i]);
        if(!(s[i]>='a'&&s[i]<='z')) break;
    }
    n=i;
    bool res=false;
    for(i=1;i<n;i++)
    {
        if(s[i-1]=='h'&&s[i]=='i') res=true;
    }
    if(res)
    {
        printf("Yes");
    }
    else
    {
        printf("No");
    }
    return 0;
}