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
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class ABeautifulYear {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int year = in.nextInt();
        int endYear = 9999;

        for(int i = year+1;i<=endYear;++i)
            if(isBeautifull(i)){
                System.out.println(i);
                break;
            }
            else
                if(i==endYear)
                System.out.println("Nie ma 'pięknego' roku w przedziale do "+endYear);
    }

    public static boolean isBeautifull(int year) {
        String yearText = year + "";
        Set y = new HashSet();
        for (int i = 0; i < yearText.length(); i++)
            y.add(yearText.charAt(i));
        if (y.size() == yearText.length())
            return true;
        else
            return false;
    }
}