Panda Yuan Yuan and Yuan Zai are playing game with water pipes and balls. There are two ends of water pipes, the front end and the back end. And the water pipe is capable of putting 1000 balls. There are English alphabets and numbers printed on the balls. Yuan Yuan puts balls which is 0~4 and a~m into the front end. Yuan Zai puts balls which is 5~9 and n~z into the back end.
Hint: ASCII
| Letter | ASCII | Letter | ASCII | Letter | ASCII | Letter | ASCII | Letter | ASCII | Letter | ASCII |
|
0 |
48 | 6 | 54 | c | 99 | i | 105 | o | 111 | u | 117 |
| 1 | 49 | 7 | 55 | d | 100 | j | 106 | p | 112 | v | 118 |
| 2 | 50 | 8 | 56 | e | 101 | k | 107 | q | 113 | w | 119 |
| 3 | 51 | 9 | 57 | f | 102 | l | 108 | r | 114 | x | 120 |
| 4 | 52 | a | 97 | g | 103 | m | 109 | s | 115 | y | 121 |
| 5 | 53 | b | 98 | h | 104 | n | 110 | t | 116 | z | 122 |
and the * is 42, if you need.
The input consists of two things.
First is water pipes number.
Second is ball’s sign.
＊means newline also means new link list
Please print the sign of balls from the front end to the back end.
Each answer is followed by a newline ' ', namely std::endl;