A - Hitachi String /

### 制約

• S の長さは 1 以上 10 以下
• S は英小文字列

### 入力

S


### 出力

S が hitachi文字列 であれば Yes を、そうでなければ No を出力せよ。

### 入力例 1

hihi


### 出力例 1

Yes


hihihi2 個繋げてできる文字列なので、 hitachi文字列です。

### 入力例 2

hi


### 出力例 2

Yes


### 入力例 3

ha


### 出力例 3

No


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