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.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;

public class Round166ProblemA {
	public static void main(String[] args) {
		Reader r = new Reader();
		int n = r.nextInt();
		int jedn, des, sto, tis;
		while (true) {
			n++;
			jedn = n % 10;
			des = n % 100;
			des -= jedn;
			sto = n % 1000;
			sto = sto - des - jedn;
			tis = n - sto - des - jedn;
			des /= 10;
			sto /= 100;
			tis /= 1000;
			if (jedn != des && jedn != sto && jedn != tis && des != sto
					&& des != tis && sto != tis) {
				break;
			}
		}
		System.out.println(tis + "" + sto + "" + des + "" + jedn);
	}

	static class Reader {
		StreamTokenizer in = new StreamTokenizer(new BufferedReader(
				new InputStreamReader(System.in)));

		public int nextInt() {
			try {
				in.nextToken();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return (int) in.nval;
		}

		public String nextString() {
			try {
				in.nextToken();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return in.sval;
		}
	}
}
