Problem

5 /8


Search in a string

Theory Click to read/hide

To search within a string in Pascal, use the pos() method.
It has returns the index of the 1st occurrence of the substring in the string:
pos(originalString, smallString) - looks in originalString smallString

When the substring is not found, the method returns 0:

welcome := 'Hello world! Goodbye world!';
index := pos(welcome, 'wor');
writeln(index); // 7

index := pos(welcome, 'sun');
writeln(index); // 0

Please note: these methods do not look for the number of occurrences, but only determine whether there is such a substring in the string or not.

Problem

Given a string in which the letter h occurs at least twice. Remove the first and last occurrences of the letter h from this string, as well as all characters between them.

Input

A string is being entered.

Output

Display the answer to the problem.

Examples

# Input Output
1 In the hole in the ground there lived a hobbit In tobbit

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!