Problem Description

You are given a string $s$ of length $4$ consisting of uppercase alphabets. Determine if $s$ is "equal in the sense of the number of holes" to the string "UTPC". "Equal in the sense of the number of holes" means that the number of holes in the corresponding characters at each position are equal. Here, the alphabets with $0$ holes are CEFGHIJKLMNSTUVWXYZ, the alphabets with $1$ hole are ADOPQR, and the alphabet with $2$ holes is B.

Input Format

The input is given in the following format:

$s_1s_2s_3s_4$

Each $s_i$ represents the $i$-th character.

Output Format

Output "yes" if the given string is equal to "UTPC" in the sense of the number of holes, otherwise output "no".

Sample Input and Output

Sample Input #1

KUPC

Sample Output #1

yes

Sample Input #2

UTPC

Sample Output #2

yes

Sample Input #3

UTBC

Sample Output #3

no

Notes/Hints

Each variable in the input satisfies the following constraints:
- Each $s_i$ is a single alphabet from 'A' to 'Z'.

见题面 Input 部分

见题面 Output 部分