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



Sample input:
hihi


Sample output:
Yes

Submission status: Wrong Answer

Solution code:
S=input()
flag=True

if len(S)%2!=0:
  print("No")
else:
  for i in range(len(S)//2):
    if S[2*i]+S[2*i+1]=="hi":
      pass
    else:
      flag=False
      break
      
if flag:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
chk_str = input()
print('Yes' if 'hi' in chk_str else 'No')

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
c = 0
if any(s[i]+s[i-1] == 'hi' for i in range(1,n)):
    c = 1

if c == 0:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
text = input()
flag = 0
for s in text:
    if flag == 0 and s == "h":
        flag = 1
    elif flag ==1 and s == "i":
        flag = 0
    else:
        print("No")
print("Yes")

Submission status: Wrong Answer

Solution code:
s = input()
for i in range(len(s)):
	if not (i%2==1 and s[i] == "i" or i%2==0 and s[i] == "h"):
		print("No")
		exit()

print("Yes")

Submission status: Wrong Answer

Solution code:
s = list(input())
for i in range(len(s)-1):
    if s[i] == 'h' and s[i+1] == 'i':
        print('Yes')
        exit()
print('No')

Submission status: Wrong Answer

Solution code:

a = input()
print(a)

if a == 'hi' or 'hihi' or 'hihihi' or 'hihihihi' or 'hihihihihi':
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from sys import exit

s = input()

for i in range(len(s)):
    if i%2==0:
        if s[i]!='h':
            print('No')
            exit()
    else:
        if s[i]!='i':
            print('No')
            exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
s = list(input())
c = 0
for i in range(len(s)-2):
    if s[i] == "h" and s[i+1] == "i" and s[i+2] != "i":
        c += 1
if c >= 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()

if s == 'h':
    print('No')
    exit()

f = True
for i in s:
    if f:
        if i != 'h':
            break
        else:
            f = False
    else:
        if i != 'i':
            break
        else:
            f = True
else:
    print('Yes')
    exit()
print('No')

Submission status: Wrong Answer

Solution code:
s = input()

flag = False
for i in range(len(s)-1):
  if s[i] == "h":
    if s[i+1] == "i":
      flag = True

if flag == True:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s=input()
i=0
if s[i:i+2]=="hi":
    print("Yes")
    exit()

print("No")

Submission status: Wrong Answer

Solution code:
s = input()
if s == "hi" or s == "hihi" or s == "hihihi" or s == "hihihihihi" or s == "hihihihihi":
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S=input()
C=0
for i in range(len(S)-1):
    if (S[i] == "h") & (S[i+1] == "i"):
        C=1
if C==1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=input().count("hi")
if s>=1:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s=input()
n=len(s)
for i in range(n):
    if s[i]=="h" and i!=n-1:
        if s[i+1]=="i":
            print("Yes")
            break
    if i==n-1:
        print("No")

Submission status: Wrong Answer

Solution code:
s = input()

flag = True
for i in range(len(s)):
    if i%2 == 0:
        if s[i] != "h":
            flag =False
            break
    else:
        if s[i] != "i":
            flag = False
            break

if flag:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = str(sys.stdin.readline().rstrip())
    print('Yes' if N[:2] == 'hi' else 'No')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
s=input()
if len(s)%2==1:
    print("No")
    exit()
for i in range(len(s)//2,2):
    if s[i] != "h" or s[i+1] != "i":
        print("No")
        exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
s=input()

tog=True
for i in s:
    if tog:
        if i!="h":
            print("No")
            exit(0)
    else:
        if i!="i":
            print("No")
            exit(0)
    tog=not tog

print("Yes")

Submission status: Wrong Answer

Solution code:
n = input()
list_n = list(n)
ans = "No"
for i in range(len(n)-1):
    if list_n[i] == "h" and list_n[i+1] == "i":
        ans = "Yes"

print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
if "hi" in s:
    print("Yes")
elif "hihi" in s:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
ans = 0
for i in range(1, len(s)):
    if s[i-1] == 'h' and s[i] == 'i':
        ans += 1
if ans:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()
if "hi" in s:
  for i in s:
    if i != "h" or i != "i":
      print("No")
      exit()
    print("Yes")
    exit()
print("No")

Submission status: Wrong Answer

Solution code:
a = input()
ok = True
for i in range(len(a)//2, 2):
    if a[i:i + 2] != "hi":
        ok = False
        break

if ok:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=input()
a=s.count("hi")
if a>=0.5:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=input()

for i in range(len(s)):
    if i%2==0 and s[i] == 'h':
        continue
    elif i%2==1 and s[i] == 'i':
        continue
    else:
        print('No')
        exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
import sys

S = input()
if len(S) % 2 != 0:
    print("No")
else:
    for i in range(len(S) // 2):
        if S[2 * i] + S[2 * i + 1] == "hi":
            continue
        else:
            print("No")
            sys.exit()

print("Yes")

Submission status: Wrong Answer

Solution code:
#import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math

import itertools

#import bisect

import copy
from functools import lru_cache

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]



def main():
    s=input()
    s=list(s)
    temp=0
    ans="No"
    for i in range(len(s)):
        if s[i]=="h":
            temp=1
        elif s[i]=="i" and temp==1:
            ans="Yes"
            break
        else:
            temp=0
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
S = str(input())

if('hi' in S):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S=str(input())
if "hi" in S:
    print("Yes")
else:print("No")

Submission status: Wrong Answer

Solution code:
import sys
s = input()
for i in range(len(s)):
    if s[i] == "h" and s[i+1] == "i":
        print("Yes")
        sys.exit()
print("No")

Submission status: Wrong Answer

Solution code:
S = input()

while len(S) >= 2:
    if S[:2] == "hi":
        S = S[2:]
    else:
        print("No")
        exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
a=input()
if "hi" in a:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S = input()
if "hi" in S : print("Yes") 
else: print("No")

Submission status: Wrong Answer

Solution code:
S = list(str(input()))

status = 0
det = 0

for i in range(len(S)):
    if status == 0 and S[i] != "h":
        det = -1
        break
    elif status == 1 and S[i] != "i":
        det = -1
        break
    status += 1
    status %= 2

if det == 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
for i, s in enumerate(input()):
    if i % 2:
        if s != "i":
            print("No")
            break
    else:
        if s != "h":
            print("No")
            break
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
s = str((input()))

for i in range(len(s) - 1):
    if s[i] == "h" and s[i+1] == "i":
        print('Yes')
        exit()
print('No')

Submission status: Wrong Answer

Solution code:

s = input()

flg = 0
for i in range(len(s)-1):


    if s[i] == 'h' and s[i+1] == 'i':
        print('Yes')
        exit()


print('No')

Submission status: Wrong Answer

Solution code:
import sys
from collections import defaultdict, Counter, deque
from itertools import accumulate, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right, bisect
from heapq import heappop, heappush
from fractions import gcd
from math import ceil, floor, sqrt, cos, sin, pi
from copy import deepcopy

# If you use recursive call, uncomment this code
#sys.setrecursionlimit(10**6)

def main():
    S = input()
    for i in range(len(S)//2):
        t = i*2
        if S[t:t+2] != "hi":
            return "No"
    return "Yes"

if __name__ == '__main__':
    print(main())

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    #input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations
    #from itertools import accumulate, product
    from bisect import bisect_left,bisect_right
    from math import floor, ceil
    #from operator import itemgetter

    #mod = 1000000007

    s = list(input())
    for i, x in enumerate(s):
        if i%2==0:
            if x!='h':
                print('No')
                exit()
        else:
            if x!='i':
                print('No')
                exit()
    print('Yes')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
S = input()

for i, s in enumerate(S):
    if i % 2 == 0:
        if s == 'h':
            continue
        else:
            break
    else:
        if s == 'i':
            continue
        else:
            break
else:
    ans = 'Yes'
    print(ans)
    exit()
print('No')

Submission status: Wrong Answer

Solution code:
n=input()
if 'hi' in n:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = list(input())
ans = 'No'
cnt = 0
for i in range(len(s) -1):
    if s[i] == 'h' and s[i+1] == 'i':
        cnt += 1
if cnt == (len(s)//2):
    ans = 'Yes'
print('Yes')

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
from collections import deque
from string import ascii_uppercase
import sys, bisect, math, heapq

stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()

S = read_str()

def solve():
    for i, s in enumerate(S):
        if i % 2 == 0:
            if s != 'h': return 'No'
        else:
            if s != 'i': return 'No'
    return 'Yes'

if __name__ == "__main__":
    print(solve())

Submission status: Wrong Answer

Solution code:
s = list(input())
if len(s)%2 == 1:
  print("No")
elif s.count("hi") == len(s)//2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
S=list(input())
flg=True

for i in range(len(S)):
    if i%2==0:
        if S[i]!="h":
            flg=False
    else:
        if S[i]!="i":
            flg=False

if flg:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=input()
for i in range(len(s)-1):
    if s[i:i+2]=="hi":
        print("Yes")
        exit()

print("No")

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols

    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])

    return ret


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_map_as_int(H):
    '''
    #→1,.→0として読み込む
    '''
    ret = []
    for _ in range(H):
        ret.append([1 if s == '#' else 0 for s in read()[:-1]])
        # 内包表記はpypyでは若干遅いことに注意
        # #numpy使うだろうからこれを残しておくけど
    return ret


# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from fractions import gcd


def lcm(a, b):
    # 最小公約数
    g = gcd(a, b)
    return a * b // g


S = read()[:-1]
if len(S) < 2:
    print('No')
    exit()
hi = 'hi'
for s, ss in zip(S[::2], S[1::2]):
    if hi != s + ss:
        print('No')
        exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
S = input()
print('Yes' if 'hi' in S else 'No')

Submission status: Wrong Answer

Solution code:
S = input()
judge = True
for i in range(len(S)):
  if i%2==0:
    if S[i]=='h':
      continue
    else:
      judge=False
      break
  else:
    if S[i]=='i':
      continue
    else:
      judge=False
      break
      
if judge:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s = input()
p = len(s)
s = s.replace('hi', '')
a = len(s)
if p -a>= 4:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s=input()
n=len(s)
for i in range(n):
    if i%2==0 and s[i]!="h":
        print("No")
        break
    if i%2!=0 and s[i]!="i":
        print("No")
        break
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
s = input()

if "hi" in s:
  print("Yes")
else: print("No")

Submission status: Wrong Answer

Solution code:
S = input()

if 'hi' in S:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
S=input()
ans="Yes"
for i in range(len(S)):
    if i%2==0:
        if S[i]!="h":
            ans="No"
            break
    if i%2==1:
        if S[i]!="i":
            ans="No"
            break
print(ans)

Submission status: Wrong Answer

Solution code:
S = input()
if 'hi' in S:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = input()
# print("S:", S)
for i in S:
    if S[:2] != 'hi':
        print('No')
        exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
S = str(input())

ans = 'Yes'
for i in range(len(S)):
  if i%2==0:
    if S[i] != 'h':
      ans = 'No'
      break
  else:
    if S[i] != 'i':
      ans = 'No'
      break
    
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
if 'hi' in s:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = list(input())
for i in range(len(S) - 1):
    if S[i] == 'h' and S[i + 1] == 'i':
        print('Yes')
        exit()
print('No')

Submission status: Wrong Answer

Solution code:
def main():
    S = input()
    L_S = len(S)
    for i in range(L_S - 1):
        if S[i] == 'h' and S[i + 1] == 'i':
            print('Yes')
            exit()
    print('No')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
S = input()

if S.count("hi"):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
if s == 'hi' or 'hihi' or 'hihihi' or 'hihihihi' or 'hihihihihi':
    print('Yes')
else: print('No')

Submission status: Wrong Answer

Solution code:
s = input()

ans = True

for i in range(len(s)):
    if i % 2 == 0:
        if s[i] != 'h':
            ans = False
    else:
        if s[i] != 'i':
            ans = False

if ans:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
#gcdは3.4.3だとfractionsにある
from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "Yes"
no = "No"

def main():
    s = input()
    for i in range(len(s)):
        if i%2 == 0 and s[i] == 'h':
            continue
        elif i%2 == 1 and s[i] == 'i':
            continue
        else:
            print(no)
            exit()
    print(yes)
            




main()

Submission status: Wrong Answer

Solution code:
S = input()

for i in range(len(S) - 1):
    if S[i] == "h" and S[i + 1] == "i":
        print("Yes")
        exit()

print("No")

Submission status: Wrong Answer

Solution code:
s = input()
flag = False
for i in range(len(s)-1):
    if s[i] == "h" and s[i+1] == "i":
        flag = True
        break
if flag:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()

if s in "hi":
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=input()

if 'hi' in s:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()

if 'hi' in s:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()

if "hi" in S:
    if "hii" in S:
        print("No")
    else:
        print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = list(input())
ans = "No"
for i in range(len(S)-1):
    if ("".join(S[i:i+2]) == "hi"):
        ans = "Yes"
        break

print(ans)

Submission status: Wrong Answer

Solution code:
import re

pattern = re.compile("(hi)+")
s = input()
print("YES" if pattern.fullmatch(s) else "NO")

Submission status: Wrong Answer

Solution code:
S = input()

for i in range(len(S)):
    if i % 2 == 0:
        if S[i] != "h":
            print("No")
            exit()
    else:
        if S[i] != "i":
            print("No")
            exit()

print("Yes")

Submission status: Wrong Answer

Solution code:
str_hi = str(input())
if "hi" in str_hi:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()
if 'hi' in S and 'hii' not in S:
    print('Yes')
else:
    print("No")

Submission status: Wrong Answer

Solution code:
hitachi = input()

if hitachi in 'hi':
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
S=str(input())

if ('hi' in S):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()

ok_list = ["hi" * n for n in range(1, 5)]

if s in ok_list:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s=input()
print('Yes' if s.count('hi')==len(s)//2 else 'No')

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
from math import floor

def main():
    #n,p=map(int,input().split())
    s=input()
    cnt=len(s)//2
    chk='hi'*cnt
    if s==chk:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
s=input()

for j in range(1,len(s)):
  if s[j-1]=="h" and s[j]=="i":
    print("Yes")
    exit()
print("No")

Submission status: Wrong Answer

Solution code:
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
s = l()
for i in range(len(s)-1):
    if s[i] == "h" and s[i+1] == "i":
        print("Yes")
        exit()
print("No")

Submission status: Wrong Answer

Solution code:
value = input()

if 'hi' in value:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s = input()

f = True
for i in s:
    if f:
        if i != 'h':
            break
        else:
            f = False
    else:
        if i != 'i':
            break
        else:
            f = True
else:
    print('Yes')
    exit()
print('No')

Submission status: Wrong Answer

Solution code:
s = list(input())
c = 0
for i in range(len(s)-1):
    if s[i] == "h" and s[i+1] == "i":
        c += 1
if c >= 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = str(input())
flag = 0
for i in range(len(s)-1):
    if(s[i] == "h" and s[i+1] == "i"):
        flag = 1
if(flag == 1):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
if s.find('hi') > -1:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
# じょえチャンネルおもしろいよ～～～
# https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ

Hitachi="Hitachi"
hitachi="hitachi"

s=input()
if "hi" in s:print("Yes")
else:print("No")

Submission status: Wrong Answer

Solution code:
s = input().rstrip()
if len(s) >= 2 and s.startswith("hi"):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
hi ="hi"
s = input()
if(hi in s):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input().rstrip()
if 'hi' in S:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read


#n,a = [int(i) for i in read().split()]

s = input()
s = s.replace("hi","X")
if len(set(s)) == 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
input_str = input()

if input_str.count("hi"):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s = input()
ans = 0
for i in range(1, len(s)):
    if s[i-1] == 'h' and s[i] == 'i':
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
print("Yes" if input().count("hi") >= 1 else "No")

Submission status: Wrong Answer

Solution code:
str = input()
yes = str.find("hi")
print("Yes" if yes != -1 else "No")

Submission status: Wrong Answer

Solution code:
w = input()

if 'hi' in w:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def main():
  s=input()
  if s.count('hi')==len(s)//2:
    print('Yes')
  else:
    print('No')

  
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
s=input()
for i in range(len(s)):
    if i%2==0 and s[i]!='h':
        print("No")
        exit()
    if i%2==1 and s[i]!='i':
        print("No")
        exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
n = input()
print("No" if n.count("hi") == 0 else "Yes")

Submission status: Wrong Answer

Solution code:
S = list(input())

for i in range(len(S) // 2):
    if S[2 * i : 2 * i + 2] == list("hi"):
        pass
    else:
        print("No")
        break
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
S= input()
if 'hi' in S:
  print('Yes')
  exit()
print('No')

Submission status: Wrong Answer

Solution code:
S = input()
hitachi = ["hi"*i for i in range(1,5)]

if S in hitachi:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
h = input()
if h.find('hi') == -1:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
#A = list(map(int, input().split()))
print("Yes") if s.find("hi") >= 0 else print("No")

Submission status: Wrong Answer

Solution code:
s = str(input())
if "hi" in s:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a = input()

ans = "No"
for i in range(len(a)-1):
    if a[i] == "h" and a[i+1] == "i":
        ans = "Yes"

print(ans)

Submission status: Wrong Answer

Solution code:
S = input()
if 'hi' in S:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s=input()
if "hi" in s:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s=input()
if 'ha' in s or 'hii' in s:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(S: str):
    if S.count('hi'):
        print(YES)
    else:
        print(NO)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
S = input()
s2 = S[::2]
s1 = S[1::2]
if not 'h' in s2 or not 'i' in s1:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
S = input()
if S.count('hi')>0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()

if s == "hi" or s == "hihi" or s == "hihihi" or s == "hihihihi" or s == "hihihihi":
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S=input()

if len(S)//2==S.count('hi'):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s = str(input())
if 'hi' in s:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S=input()

if 'hi' in S:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=input()
if len(s)==1:
    print("No")
    exit(0)
if s[0]=="h" and s[1]=="i":
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
import string


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


s = input()
if 'hi' in s:
    print('Yes')
    exit()
print('No')

Submission status: Wrong Answer

Solution code:
S = input()
if 'hi' in S :
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S = input()

for i in range(len(S) - 2):
    if S[i] == "h" and S[i + 1] == "i":
        print("Yes")
        exit()

print("No")

Submission status: Wrong Answer

Solution code:
s = input()

if "hi" in s:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import re
s = input()
if re.match(r'(hi)+', s):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
a = input()
if "hi" in a:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
for i in range(len(s)):
    if s[i] == 'h':
        if i + 1 < len(s) and s[i+1] == 'i':
            print('Yes')

            exit()
print('No')

Submission status: Wrong Answer

Solution code:
#n = int(input())
s = input()
#a,b = map(int,input().split())
#a_L = list(map(int,input().split()))

if s == "hi":
    print("Yes")
    exit()
s = s.split("hi")
if len(s) != 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
import bisect
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

s = S()
if s.count("hi"):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
import sys
s = input()
for i in range(len(s)-1):
    if s[i] == "h" and s[i+1] == "i":
        print("Yes")
        sys.exit()
print("No")

Submission status: Wrong Answer

Solution code:
a=input()
if 'hi' in a:
    print('Yes')
else:
    print('No')