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.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;

public class prac3 {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb = new StringBuilder();
        String s = br.readLine();
        int i = pi(s) + 1;
        boolean found = false;
        while(!found){  
            HashSet<Character> st = new HashSet<>();
            String k = Integer.toString(i);
            for(int j = 0; j <= 3; ++j) st.add(k.charAt(j));
            
            if(st.size() == 4){System.out.println(i); break;}
            ++i;
        }
        
    }

    public static String[] ti(BufferedReader br) throws IOException {
        return br.readLine().split(" ");
    }

    public static int pi(String s) {
        return Integer.parseInt(s);
    }
}
