Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word "hello". For example, if Vasya types the word "ahhellllloou", it will be considered that he said hello, and if he types "hlelo", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word s.

Input

The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters.

Output

If Vasya managed to say hello, print "YES", otherwise print "NO".

Examples

Input

ahhellllloou


Output

YES


Input

hlelo


Output

NO
#coding=utf-8
import re
import sys


def factorial(n):
    if not n:
        return 1
    else:
        return reduce(lambda x, y: x * y, xrange(1, n + 1))


def fibonacci():
    a, b = 1, 1
    while True:
        yield a
        a, b = b, a + b


def is_pandigital(num, s=9):
    n = str(num)
    return len(n) == s and not '1234567890'[:s].strip(n)


def is_prime(n):
    if n <= 1:
        return False
    for i in xrange(2, int(n ** 0.5) + 1):
        if n % i == 0:
            return False
    return True


def prime_list(n):
    begin_list = [0, 0] + [1] * (n - 1)
    for i in xrange(2, int(n ** 0.5) + 1):
        if begin_list[i]:
            for j in xrange(i, n / i + 1):
                begin_list[j * i] = 0
    return [i for i in xrange(len(begin_list)) if begin_list[i] == 1]


def sum_of_divisors_of_num(number):
    result = 1
    for x in xrange(2, int(number ** 0.5) + 1):
        if number % x == 0:
            result += x
            if x != number / x:
                result += number / x
    return result


def latest_bigger_int(num):
    if float(num) < 0:
        return 0
    elif num == int(num):
        return int(num)
    else:
        return int(num) + 1


def gcd(first, second):
    if (first < second):
        first, second = second, first
    while second != 0:
        first, second = second, first % second
    return first


def main():
    string = raw_input()
    if re.findall(r'h.*e.*l.*l.*o',string):
        print 'YES'
    else:
        print 'NO'

if __name__ == '__main__':
    main()
