Problem Description

Takahashi saw a mysterious creature one day.

It was discovered that the creature uses a language called choku Language.

A string $ S $ is defined as choku Language if it satisfies one of the following conditions:

• The string $ S $ is an empty string.
• The string $ S $ is a string obtained by appending ch to the end of a choku Language string T.
• The string $ S $ is a string obtained by appending o to the end of a choku Language string T.
• The string $ S $ is a string obtained by appending k to the end of a choku Language string T.
• The string $ S $ is a string obtained by appending u to the end of a choku Language string T.

To deepen the understanding of choku Language, Takahashi decided to create a program that determines whether a given string is choku Language or not.

Input Format

The input is given from the standard input in the following format:

$ X $

• The first line contains the string $X\ (1\ ≦\ |X|\ ≦\ 50)$ that needs to be determined if it is choku Language.
• $ X $ consists of only lowercase alphabets.

Output Format

Output YES if $ X $ is choku Language, otherwise output NO. Ensure to include a newline at the end of the output.

Sample Input and Output

Sample Input #1

chokuou

Sample Output #1

YES

Sample Input #2

kuccho

Sample Output #2

NO

Sample Input #3

atcoder

Sample Output #3

NO

Notes/Hints

Sample Explanation 1

The string chokuou is choku Language.

Sample Explanation 2

The string kuccho is not choku Language.

见题面 Input 部分

见题面 Output 部分