Mock CCC '18 Contest 1 J1 - A String Problem

Points: 3 (partial)

Time limit: 2.0s

Memory limit: 1G

Problem type

Given a positive integer $N$ $N$ with no zeroes in its base-10 representation, compute the smallest positive integer greater than $N$ $N$ with no zeroes in its base-10 representation.

Constraints

$1 \le N \le 999\,999$ $1 \leq N \leq 999 999$

$N$ $N$ will not contain the digit zero in its base-10 representation.

Input Specification

The input consists of a single line containing the integer $N$ $N$ .

Output Specification

Print, on a single line, the smallest positive integer greater than $N$ $N$ with no zeroes in its base-10 representation.

Sample Input 1

Copy

Sample Output 1

Copy

Sample Input 2

Copy

Sample Output 2

Copy

Comments

There are no comments at the moment.