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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Hanif Naufal
 */
public class Codeforces {
    static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer token;
    public static void main(String asd[])throws Exception{
        int input = Integer.parseInt(reader.readLine());
        boolean notfound = true;
        while(notfound){
            input++;
            String temp = input + "";
            char list [] = new char[4];
            for (int i = 0; i < 4; i++) {
                list[i] = temp.charAt(i);
            }
            
            boolean ok = true;
            for (int i = 0; i < 4; i++) {
                for (int j = i + 1; j < 4; j++) {
                    if(list[i] == list[j]){
                        ok = false;
                    }
                }
            }            
            if(ok){
                System.out.println(input);
                notfound = false;
            }
        }        
    }
}
