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 22265 is transformed to 33375 while the number 809 is transformed to 919.

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.

Input

The input is a sequence of positive integers followed by the special end marker 0 (which is not part of the sequence).

Output

For each of the elements in the sequence, a line with its transformation to odd digits.

Public test cases

**Input**

22265 809 1 79531 86420 4 10 0

**Output**

33375 919 1 79531 97531 5 11

**Input**

0

**Output**