CF 271 Beautiful Year

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.

Examples

input

1987

output

2013

input

2013

output

2014

题意：从当前位置往后加一，直到找到第一个每一位都不一样的年份，输出； 

AC代码：

#include <bits/stdc++.h>
using namespace std ;
int main()
{
    int year;
    cin>>year;
    int a,  b , c , d ;
    while(1)
    {
        year++;
        a = year % 10 ;
        b = year /10 % 10 ;
        c = year /100%10;
        d = year / 1000;
        if(a!=b&&a!=c&&a!=d&&b!=c&&b!=d&&c!=d)
        {
            printf("%d\n",year);
            break;
        }
    }
    return 0 ;
}