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
no = int(input());
no += 1;
a = no // 1000;
b = (no % 1000) // 100;
c = (no % 100) // 10;
d = (no % 10);

while ((a == b) | (a == c) | (a == d) | (b == c) | (b == d) | (c == d)):
    #if ((d == a) | (d == c) | (d == b)):
    #    d += 1;
    #if ((c == a) | (c == b)):
    #    c += 1;
    #if (b == a):
    #    b += 1;
    #if (b == 10):
    #    a += 1;
    #    b = 0;
    #if (c == 10):
    #    b += 1;
    #    c = 0;
    #if (d == 10):
    #    c += 1;
    #    d = 0;
    no += 1;
    a = no // 1000;
    b = (no % 1000) // 100;
    c = (no % 100) // 10;
    d = (no % 10);
#print(a * 1000 + b * 100 + c * 10 + d);
print(no);