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.*;

public class ProblemSolving {

    public static int[] toArray(int n) {
        int size = (int) Math.log10(n) + 1;
        int array[] = new int[size];
        int div = size - 1, pos = 0;
        while (n > 0) {
            array[pos] = n / (int) Math.pow(10.0, div);
            n = n % (int) Math.pow(10, div);
            pos++;
            div--;
        }
        return array;
    }

    public static boolean check(int n) {
        int [] array = toArray(n);
        for (int i = 0; i < array.length; i++) {
            for (int j = i + 1; j < array.length; j++) {
                if (array[i] == array[j]) {
                    return false;
                }
            }
        }
        return true;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(), compare, pos = 0;
        n++;
        while (check(n) != true){
            n++;
        }
        System.out.println(n);

    }

}
