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
# Codeforces Round 166 (Division 2)
# Problem A: Beautiful Year

def distinctDigits(y):
    digits = []
    y = str(y)
    for i in xrange(4):
        if (y[i] not in digits):
            digits += [y[i]]
    return len(digits)

def beautifulYear(y):
    y += 1
    while (distinctDigits(y) != 4):
        y += 1
    return y

y = raw_input("")
y = int(y)
print beautifulYear(y)
