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

public class BeautifulYearCodeforces {
	
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int year = Integer.parseInt(scanner.nextLine());
		int man = year,count = 0,val;
		boolean found = false;
		Set<Integer> set = new HashSet<Integer>(); 
		do {
			year++;
			man = year;
			while(man != 0) {
				set.add(man%10);
				man/=10;
				count++;
			}
			if(count == set.size()) {
				found = true;
			}
			
			set.clear();
			count=0;
		}while(!found);
		System.out.println(year);
	}
}