Alice and Bob — very experienced spies. Best of all, they manage to find passwords to access various secret data. This time, too, Alice received a message from Bob saying that the key was a number, followed by the number itself. Bob also wrote that the key number should be divisible by 9. When Alice tried to enter the received password, it turned out that it did not fit. Alice trusts Bob very much, and therefore she decided that Bob could only make a mistake in one digit of the password. Since Alice does not have much time, she decided not to ask Bob for the correct answer, but to try all the numbers that could be a password, i.e. all such numbers that can be obtained from the number that Bob sent by replacing exactly one of its digits and divisible by 9. Alice turned to you for help. Write a program that will offer Alice all possible passwords.
Input
The input contains a single number P (1 ≤ P ≤ 10
9) — the number that Alice received in the message from Bob. It is guaranteed not to start from zero.
Imprint
Print in a column all the possible passwords that Alice needs to try out, in random order. None of the numbers you receive should start from zero. All possible passwords must contain the same number of digits as the original number received by Alice.
Examples
| # |
Input |
Output |
| 1 |
256 |
756
216
252 |