Beautiful Year(拆分四位数)

Description

It seems like the year of 2013 came only yesterday. Do you know a curious fact? The year of 2013 is the first year after the old 1987 with only distinct digits.

Now you are suggested to solve the following problem: given a year number, find the minimum year number which is strictly larger than the given one and has only distinct digits.

Input

The single line contains integer y(1000 ≤ y ≤ 9000) — the year number.

Output

Print a single integer — the minimum year number that is strictly larger than y and all it's digits are distinct. It is guaranteed that the answer exists.

Sample Input

Input

Output

Input

Output

 1 int main()
 2 {
 3     int n,a,b,c,d,i;
 4     while(scanf("%d",&n)!=EOF)
 5     {
 6         for(i=n+1;i<9999;i++)
 7         {
 8             a=i%10;
 9             b=(i/10)%10;
10             c=(i/100)%10;
11             d=i/1000;
12             if(a!=b&&a!=c&&a!=d&&b!=c&&b!=d&&c!=d)
13             {
14                 printf("%d
",i);
15                 break;
16             }
17 
18         }
19     }
20     return 0;

怎么说呢，这算是一道水题了吧，找出给定年份之后各个位数之和最小的那一个数，不过各个位上的数不能出现相同 distinct！！