Consider the following transformation of a positive integer where each of its even digits is replaced by the next higher odd digit. For example, the number is transformed to while the number is transformed to .
Given a sequence of positive integers (i.e., each of them is greater than zero), write a program that outputs their transformation to odd digits as described above.
The input is a sequence of positive integers followed by the special end marker (which is not part of the sequence).
For each of the elements in the sequence, a line with its transformation to odd digits.
Input
22265 809 1 79531 86420 4 10 0
Output
33375 919 1 79531 97531 5 11
Input
0
Output