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
/**
 * @author GArs
 */

import java.io.*;
import java.util.Scanner;
import java.util.StringTokenizer;

import static java.lang.Math.*;

public class Solution {
    public static void main(String[] args) {
        MyScanner in = new MyScanner(System.in);
        Solve s = new Solve();
        s.solver(in, System.out);
    }
}

class Solve {
    public final static int INF = (int) 1e9;

    boolean check(int a) {
        int[] num = new int[10];

        while (a > 0) {
            num[a % 10]++;
            a /= 10;
        }

        for (int i = 0; i < 10; i++) {
            if (num[i] > 1) return false;
        }

        return true;
    }

    public void solver(MyScanner in, PrintStream out) {
        int y = in.nextInt() + 1;

        for (int i = y; ; i++) {
            if (check(i)) {
                out.println(i);
                return;
            }
        }
    }
}

class MyScanner {
    BufferedReader br;
    StringTokenizer st;

    public MyScanner(InputStream in) {
        br = new BufferedReader(new InputStreamReader(in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    int[] nextIntArr(int n) {
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = this.nextInt();
        }

        return a;
    }

    int[] nextIntArr(int n, int chng) {
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = this.nextInt() + chng;
        }

        return a;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return str;
    }
}
