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.InputStreamReader;
import java.util.Arrays;

public class anoo {
	public static void main(String[] args) {
		try {
			BufferedReader br = new  BufferedReader(new InputStreamReader(System.in));
			String palabra = br.readLine();
			int r=salida(Integer.parseInt(palabra));
			System.out.println(r);
			
			
			
			
		} catch (Exception e) {
			// TODO: handle exception
		}
	}
	public static int salida(int numero) {
		
		for(int i=numero+1;i<=100000;i++) {
			String letra=i+"";
			//System.out.println("esto es i"+i);
			char[] numeros=letra.toString().toCharArray();
			if(llamar(numeros)) {
				//System.out.println("retorna"+i);
				return i;
			}

			
			
		}
		return 0;
	}
	public static boolean llamar(char[ ] numeros) {
		int[] mirar = new int[numeros.length];
		for(int i=0;i<numeros.length;i++) {
			mirar[i]=Integer.parseInt(numeros[i]+"");
			//System.out.println("esto es mirar "+mirar[i]);
		}
	
		
		if(mirar[3]==mirar[2]||mirar[1]==mirar[0]||mirar[2]==mirar[1 ]||mirar[0]==mirar[3 ]||mirar[1]==mirar[3 ]||mirar[0]==mirar[2 ]) {
			
			return false;
		}else
			return true;
	
		
	}

}


 	  								  		 	 		 			  	  	