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 whatever; // 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 final class Ideone
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		Scanner s=new Scanner(System.in);
		String str=s.nextLine();
		int n=Integer.parseInt(str);
		checkBeautifulYear(str,n);
	}
	public static void checkBeautifulYear(String str,int n)
	{
		boolean found=false;
		while(!found)
		{
			n++;
			str=Integer.toString(n);
			Map<Character,Integer> map=new HashMap<Character,Integer>();
			for(int i=0;i<str.length();i++)
			{
				if(map.containsKey(str.charAt(i)))
				{
					found=false;
					break;
				}
				else
				{
					found=true;
					map.put(str.charAt(i),1);
				}
			}
		}
	System.out.println(n);
	}
}