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

public class Codeforces1 {

    public static void main(String[] args) {
        // TODO code application logic here        
        char[] anio;
        int numero;
        boolean distinto = false;
        
        Scanner sc = new Scanner(System.in);
        numero = Integer.parseInt(sc.nextLine());
        numero++;
        anio = String.valueOf(numero).toCharArray();
        
        while (!distinto){
            if (anio[0] != anio[1] && anio[0] != anio[2] && anio[0] != anio[3])
                if (anio[1] != anio[2] && anio[1] != anio[3])
                    if (anio[2] != anio[3])
                        distinto = true;
                    else
                        anio = String.valueOf(Integer.parseInt(String.valueOf(anio)) + 1).toCharArray();
                else
                    anio = String.valueOf(Integer.parseInt(String.valueOf(anio)) + 1).toCharArray();
            else
                anio = String.valueOf(Integer.parseInt(String.valueOf(anio)) + 1).toCharArray();
        }
        
        System.out.println(String.valueOf(anio));
                
    }
}
