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)

#include<stdio.h>
int main()
{
	int A,B,M,a[150000],b[150000],m[150000],x[150000],y[150000],r,i,j,min,max;
	scanf("%d %d %d",&A,&B,&M);
	min=999999;
	for(i=0;i<A;i++)
	{
		scanf("%d",&a[i]);
		if(a[i]<min)
		min=a[i];
	}
	max=9999999;
	for(i=0;i<B;i++)
	{
		scanf("%d",&b[i]);
		if(b[i]<max)
		max=b[i];
	}
	for(i=0;i<M;i++)
	{
		scanf("%d %d %d",&x[i],&y[i],&m[i]);
	}
	int mat=9999999;
	for(i=0;i<M;i++)
	{
		r=a[x[i]-1]+b[y[i]-1]-m[i];
		if(r<mat)
		mat=r;
	}
	if(max+min<mat)
	printf("%d",max+min);
	else
	printf("%d",mat);
return 0;
}