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
/* package codechef; // don't place package name! */
 
import java.util.*;
import java.lang.*;
import java.io.*;
 
/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
		 Scanner sc=new Scanner(System.in); 
		 int n=sc.nextInt();
		 for(int i=n+1;i<=9012;i++)
		 {
		     if(distinct(i)){ System.out.println(i); break; }
		 }
		 
	}
	 static boolean  distinct(int n)
	{
	    HashSet<Integer> hset = new HashSet<>();
	    while(n>0){
	        hset.add(n%10);
	        n=n/10;
	    }
	    return hset.size()==4;
	}
}