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.awt.List;
import java.lang.reflect.Field;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;

public class codeforces {

	

	public static void main(String[] args) throws NoSuchFieldException, SecurityException, IllegalArgumentException, IllegalAccessException {
		// TODO Auto-generated method stub
		Scanner in=new Scanner(System.in);
		int year=in.nextInt();
		year++;
		while(true){
			char[] c=Integer.toString(year).toCharArray();
			boolean good=true;
			ex:
			for(int i=0;i<c.length;i++){
				for(int j=0;j<c.length;j++){
					if(i==j)continue;
					if(c[j]==c[i]){
						good=false;
						break ex;
					}
				}
			}
			
			if(good){
				System.out.println(year);
				return;
			}
			++year;
			
		}
	}
}