Soundex

Time limit1sMemory limit128 MB

Problem

Soundex coding groups together words that appear to sound alike based on their spelling. For example, "can" and "khawn", or "con" and "gone", are treated as equivalent under Soundex coding.

Soundex coding translates each word into a string of digits, where each digit stands for a group of letters:

1 = B, F, P, V
2 = C, G, J, K, Q, S, X, Z
3 = D, T
4 = L
5 = M, N
6 = R

The letters A, E, I, O, U, H, W, and Y are not represented in Soundex coding. When two letters that are adjacent in the word share the same code digit, that digit is written only once. Letters are collapsed only when they sit directly next to each other; if an uncoded letter separates them, each one is written. Words with the same Soundex code are considered equivalent.

Input

Each line of input contains a single word in upper case, fewer than 20 letters long. Input continues until end of file.

Output

For each input line, print the word's Soundex code on its own line. If a word contains no letter that maps to a digit, print an empty line.