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

/*
Anki:未済
作成日:①2020/03/08
*/

#include <stdio.h>

int main()
{
    char s[10];
    int i;

    while(scanf("%c\n", s) == 1 )
    {
        printf("%c", s[1]);
    }

    for( i = 0; s[i] == EOF; i++ )
    {
        if( i % 2 == 0 ) //偶数列がh
        {
            if (s[i] == 'h')
                continue;
            else
            {
                printf("No\n");
                return 0;
            }
        }
        else if (i % 2 == 1 ) //奇数列がi
        {
            if (s[i] == 'i')
                continue;
            else
            {
                printf("No\n");
                return 0;
            }
        }
        
    }
    printf( "Yes\n" );

    return 0;
}