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

public class BeautifulYear{

	public static int solve(int year){
		boolean aux = false;
		for(int i=0; !aux; i++) {
			year++;
			aux = hasDistinctDigits(year);
		}
		return year;
	}
	
	private static boolean hasDistinctDigits(int number) {
	     int numMask = 0;
	     int numDigits = (int) Math.ceil(Math.log10(number+1));
	     for (int digitIdx = 0; digitIdx < numDigits; digitIdx++) {
	         int curDigit = (int)(number / Math.pow(10,digitIdx)) % 10;
	         int digitMask = (int)Math.pow(2, curDigit);             
	         if ((numMask & digitMask) > 0) return false;
	         numMask = numMask | digitMask;
	     }
	     return true;
	 }

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();

		System.out.println(solve(n));
	}
}