|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|3 초||256 MB||27||17||15||60.000%|
Given a positive integer U, find the largest integer L such that L ≤ U and L does not contain any digit more than twice.
The input consists of a single line that contains an integer U (1 ≤ U ≤ 1018).
Output a line with an integer representing the largest number less than or equal to U that does not contain any digit more than twice.