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

public class Main
{
	static long mod=1000000007;
	public static void main(String[] args) throws IOException
	{
		FastReader in=new FastReader();
		PrintWriter pw=new PrintWriter(System.out);
		int n=in.nextInt();
		int m=n;
		Set<Integer> set=new HashSet<>();
		boolean f=true;
		while(f)
		{
			m++;
			int m1=m;
			while(m1!=0)
			{
				set.add(m1%10);
				m1/=10;
			}
			if(set.size()==4)
				f=false;
			set.clear();
		}
		pw.print(m);
		pw.flush();
	}
}

class FastReader
{
	BufferedReader br;
	StringTokenizer st;
 
	public FastReader()
	{
		br=new BufferedReader(new InputStreamReader(System.in));
	}
 
	public String next() throws IOException
	{
		if(st==null || !st.hasMoreElements())
		{
			st=new StringTokenizer(br.readLine());
		}
		return st.nextToken();
	}
 
	public int nextInt() throws IOException
	{
		return Integer.parseInt(next());
	}
 
	public long nextLong() throws IOException
	{
		return Long.parseLong(next());
	}
}