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.Scanner;
import java.util.HashSet;
public class BeautifulYear {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		int year = scan.nextInt();
		boolean notBeautiful = true;
		
		while(notBeautiful) {
			year++;
			int count = 0;
			int tmp = year;
			HashSet setOfDigits = new HashSet();
			for(int i=0;i<4;i++) {
				setOfDigits.add(tmp%10);
				tmp /= 10;
			}
			if(setOfDigits.size() == 4) notBeautiful = false;
		}
		System.out.println(year);
	}

}
