1509 -- Soundex
Time Limit :1000 MS Memory Limit :65536 KB
Accepts : 82 Submits : 642
User Accepts : 78 User Submits : 113
<Submit>   <Statistics>   <Discuss>


Soundex coding groups together words that appear to sound alike based on their spelling. For example, "can" and "khawn", "con" and "gone" would be equivalent under Soundex coding. 
Soundex coding involves translating each word into a series of digits in which each digit represents a letter: 
      1 represents B, F, P, or V

2 represents C, G, J, K, Q, S, X, or Z
3 represents D or T
4 represents L
5 represents M or N
6 represents R

The letters A, E, I, O, U, H, W, and Y are not represented in Soundex coding, and repeated letters with the same code digit are represented by a single instance of that digit. Words with the same Soundex coding are considered equivalent.


Each line of input contains a single word, all upper case, less than 20 letters long.


For each line of input, produce a line of output giving the Soundex code. 


Sample Input


Sample Output



Waterloo local 1999.09.25
<Submit>   <Statistics>   <Discuss>

Powered by Zhang Zhaoning PDL College of Computer
Since 2006.03.09 | 2007.11.22 | 2010.03.02 Copyright (r) 2006 - 2010 All Rights Reserved