An integer is considered handsome if every two of its consecutive digits are of different parity. For a given integer $N$, what is its closest handsome number?

Please note: Numbers consisting of only one digit are handsome numbers. The distance of two numbers is the absolute value of their difference.

Input

The first and only line of input contains the positive integer $N$ that consists of at most thousand digits and is not handsome.

Output

The first and only line of output must contain the required closest handsome number. If two closest numbers exist, output the smaller number first and then the larger one and separate them by a single space.

Scoring

In test cases worth 56 points, it will hold $N<{10}^9$.

Sample Input 1

13

Sample Output 1

12 14

Sample Input 2

5801001

Sample Output 2

5810101