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
x = input()
c = 0
p = x
f = 0
s = 0
t = 0
l = 0
k = 0
while c < 9000:
    p = int(p) + 1
    k = str(p)
    c = 0
    while c < len(x):
        if c == 0:
            f = k[c]
        elif c == 1:
            s = k[c]
        elif c == 2:
            t = k[c]
        elif c == 3:
            l = k[c]
        c += 1
    if int(f) != int(s) and int(f) != int(t) and int(f) != int(l) and int(s) != int(t) and int(s) != int(l) and int(t) != int(l):
        print(f + s + t + l)
        exit()
    c += 1
