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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Set;
import java.io.*;

public class Solution {
    

	
    public static void main(String[] args) throws IOException{
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
    	    	
      
    	
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	    BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
	   
	    
	    String s = br.readLine();
//	    System.out.println(s[0]);
	    int r  = Integer.parseInt(s);
//	    }
	    int a=0,b=0,c=0,d=0;
	    for(int i=r+1;i<=9999;i++)
	    {
	    	a=(i/1000)%10;
	    	b=(i/100)%10;
	    	c=(i/10)%10;
	    	d=i%10;
	    	if(a!=b&&b!=c&&c!=d&&d!=a&&a!=c&&b!=d)
	    	{
	    		System.out.println(i);
	    		break;
	    	}
	    	
	    }
	   
	   
	    out.flush();
	   
	    
    	
    }
}