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.math.BigInteger;
	//import java.math.*;
	//import java.text.DecimalFormat;
	import java.util.*;
	import java.io.*;

	public class Temp2 {
		  public static boolean isDis(int n)
		  {
		  	int[][] arr = new int[10][2];
		  	for(int i =0;i<10;i++)
		  	{
		  		arr[i][0]=i;
		  		arr[i][1]=0;
		  	}
		  	while(n!=0)
		  	{
		  		for(int i =0;i<10;i++)
		  		{
		  			if(n%10==arr[i][0])
		  				arr[i][1]++;
		  		}
		  		n/=10;
		  	}
		  	for(int i =0;i<10;i++)
		  	{
		  		if(arr[i][1]>1)
		  			return false;
		  	}
		  	return true;
		  }
		  public static void main(String[] args) throws IOException
		  {
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			StringTokenizer st = new StringTokenizer(br.readLine());
			int n = Integer.parseInt(st.nextToken());
			int result = ++n;
			while(result<100000)
			{
				if(isDis(result))
				{
					System.out.println(result);
					break;
				}
				result++;
			}
		  }
}
