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.math.BigInteger;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Problem {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String x = sc.next();
		int y = Integer.valueOf(x);
		
		Set<Character> setA = getFromX(x);
		for (int i = y+1; i <= 10000; i++) {
						
			Set<Character> setB = getFromX(String.valueOf(i));
			
			if (setB.size()==4) {				
				System.out.println(i);
				break;
			}
		}
		
		sc.close();
	}

	private static Set<Character> getFromX(String x) {
		Set<Character> set = new HashSet<>();
		for (int j = 0; j < x.length(); j++) {
			set.add(x.charAt(j));
		}
		return set;
	}

	private static int sizeOfNumber(int i) {
		int result = 0;
		while (i != 0) {
			i = i / 10;
			result++;
		}

		return result;
	}

}