B. Back in the Day
time limit per test
1 second
memory limit per test
512 megabytes
input
standard input
output
standard output

Your father once shared with you a thrilling story from his days as a spy during a family reunion. He had traveled around the world gathering critical information, and one of his favorite memories was from a mission that required him to infiltrate a secret organization.

On that mission, his objective was to retrieve a report hidden in the deepest vault of a heavily secured basement. To access the vault, he had to crack a keypad, which required a passcode composed of English letters. Although he didn't know the passcode, luck was on his side. While hiding in a nearby vent, he overheard the organization's boss entering the code. He couldn't see the keypad, but he could still hear the sounds of the keys being pressed.

The keypad worked like the multi-tap system found on old phones, where pressing a key multiple times cycles through the letters associated with that key. If, for example, the passcode was $$$cat$$$, the boss would have to press the $$$2$$$ key three times for $$$c$$$, pause, press $$$2$$$ again for $$$a$$$, pause, and then press $$$7$$$ once for $$$t$$$.

Figure B.1: Examples of the keypad

Typically, pressing a key more times than the number of characters it represents will cycle back to the first character. However, the boss was extremely cautious and never pressed a key too many times. For instance, he would never press the $$$2$$$ key four times to type the letter $$$a$$$.

Each key produced a distinct pitch, and your father, with his keen ear, could identify which buttons were pressed. He jotted down the tapping sequence in his notebook but didn't record the pauses. For instance, if the passcode was $$$cat$$$, he would have written down $$$22228$$$.

Later, he realized he could simply have slipped into the vault before the door shut completely. Using his stealth skills, he managed to enter the vault, retrieve the report, and escape the building without being detected.

A few days after the mission, curiosity got the better of him. He looked back at the tapping sequence he had noted and wondered about the passcode. Now you are also intrigued; what passcode could it possibly be ?

Input

One line contains a single non-empty string consisting of the numbers from $$$2$$$ to $$$9$$$. The length of this string will not be greater than $$$200$$$ characters.

Output

Print the passcode string that corresponds to the given tapping sequence. If there are multiple such strings, print the shortest one. If there are still multiple such strings, then print the lexicographically smallest of them.

For two strings $$$a$$$ and $$$b$$$, $$$a$$$ is lexicographically smaller than $$$b$$$ if $$$a$$$ is a prefix of $$$b$$$ or in the first position where $$$a$$$ and $$$b$$$ differ, the string $$$a$$$ has a letter that appears earlier in the alphabet than the corresponding letter in $$$b$$$. For example, $$$code$$$ is lexicographically smaller than $$$cow$$$.

Examples
Input
4442227222
Output
icpc
Input
22228
Output
act
Input
66666666355533
Output
noodle
Note

In the second example, both $$$aaaat$$$ and $$$cat$$$ also have a tapping sequence of $$$22228$$$, but $$$act$$$ is shorter than $$$aaaat$$$ and is lexicographically smaller than $$$cat$$$.