레이팅 미적용설명
\(5^{th}\) round, January \(17^{th}\) 2015
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.
제약
In test cases worth 56 points, it will hold \(N < 10^{9}\).
입력 형식
The first and only line of input contains the positive integer \(N\) that consists of at most thousand digits
and is not handsome.
출력 형식
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.
예제 1
입력
13
5801001출력
output
12 14
5810101문제 정보