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 void main(String[] args) {
		// TODO Auto-generated method stub
		
		Scanner scn = new Scanner(System.in);
		int n = scn.nextInt();
		n = n+1;
		
		while(!isDistinct(n)) {
			n += 1;
		}

		System.out.println(n);
	}
	public static boolean isDistinct(int n) {
		Set< Integer> map = new HashSet<>();
		while( n !=0 ) {
			
			int rem = n % 10;
			if(map.contains(rem)) {
				return false;
			}else {
				map.add(rem);
			}
			
			
			
			n /= 10;
		}
		
		return true;
	}

}
