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

public class BeautifulYear271A {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int i = input.nextInt();
        i = i + 1;
        while(i <= Integer.MAX_VALUE){
            if(isDistinct(i)){
                System.out.println(i);
                return;
            }
            else {
                i++;
            }
        }
    }
    
    private static boolean isDistinct(int num){
        String numstring = String.valueOf(num);
        Hashtable<Character,Integer> hash = new Hashtable<Character, Integer>();        
        for(int i = 0; i < numstring.length(); i++){
            if(!hash.containsKey(numstring.charAt(i))) {
                hash.put(numstring.charAt(i), 1);
            }
            else {
                return false;
            }
        }
        return true;
    }
}