#JSUTFPC2025B. Hachimionameruto —— 哈基米有南北绿豆

Hachimionameruto —— 哈基米有南北绿豆

Statement

Hachimi, originally referring to a type of honey drink.

Recently, Timothy felt he wasn't impressive enough because his roommates had accidentally stumbled upon "licking the honeycomb" and became curious, so he decided to search for it on Bilibili, and now every day in the dorm is:

Hachimi o name ru to~
ah siha yaku naru ~
wa xia ma zi li man bo ~
hakimi dabu ludu ......

This task requires you to complete a perpetual motion machine named "onamerut". The rules for this tool are:

  1. If the string matches the substring "hachimi" [1], then output "Yes";
  2. Otherwise, output "No".

Input

The input consists of a single line containing a string ss consisting of lowercase letters, where the length s|s| of ss satisfies 0<s1050<|s|\leqslant 10^5.

Output

If the string matches the substring hachimi, output Yes. Otherwise, output No. The output is not case-sensitive; for example, YES and yEs are both considered as Yes.

Samples

hachimionameruto
Yes
himionhrutoameac
No
mabo
No

  1. A string s1s_1 is said to match a substring s2s_2 if and only if every character of s2s_2 appears in s1s_1 and must be adjacent in position and in the same order as in the original string. ↩︎