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

public class test {

	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		
		int n = scan.nextInt();
		
		while(true)
		{
			int[] arr = new int[10];
			boolean check = false;
			
			int j = ++n;
			while(true) {
				arr[j%10]++;
				if(arr[j%10]>1)
					break;
				
				j/=10;
				if(j==0) {
					check = true;
					break;
				}
			}	
			if(check) {
				System.out.println(n);
				break;
		}
		
		}
		
	}
}
//		int[] num = new int[8000];
//		int count = 0;
//		for(int i=1000;i<=9000;i++)
//		{
//			String str = Integer.toString(i);
//			if((str.charAt(0)==str.charAt(1))||(str.charAt(0)==str.charAt(2))
//					||(str.charAt(0)==str.charAt(3))
//					||(str.charAt(1)==str.charAt(2))||
//					(str.charAt(1)==str.charAt(3))||(str.charAt(2)==str.charAt(3))) {
//				continue;
//			}
//			else {
//				int k = Integer.parseInt(str);
//				num[count] = k;
//				count++;
//			}
//		}
//		int a = scan.nextInt();
//		if(a>=1000&&a<1023) {
//			System.out.print(1023);
//			return;
//		}
//			
//		for(int i=0;i<8000;i++)
//		{
//			if(num[i]==a) {
//				System.out.print(num[i+1]);
//				return;
//			}
//			if(num[i]==8976) {
//				System.out.
//			}
//		}
	
