Pikachu

Interview

Time limit2sMemory limit512 MB

Summary

Decide whether a given lowercase string can be split into a sequence of the tokens "pi", "ka", and "chu".

Level: Easy3 of 10
Topics: String, Greedy, Implementation
Solved: No attempts yet

Problem

Pikachu can pronounce "pi", "ka", and "chu". So Pikachu can pronounce only words made by joining these three syllables. For example, Pikachu can pronounce "pikapi" and "pikachu".

Given a string $S$ , write a program that determines whether Pikachu can pronounce it.

Input

The first line contains the string $S$ . $S$ consists only of lowercase English letters, and its length is at most 5000.

Output

Print YES if $S$ can be formed by concatenating "pi", "ka", and "chu", and NO otherwise.

Examples5

Example 1
Input
```
pikapi
```
Expected output
```
YES
```
Example 2
Input
```
pipikachu
```
Expected output
```
YES
```
Example 3
Input
```
pikaqiu
```
Expected output
```
NO
```
Example 4
Input
```
piika
```
Expected output
```
NO
```
Example 5
Input
```
chupikachupipichu
```
Expected output
```
YES
```