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
##n = input()
##summ = n.count("l")
##word = ['h','e','l','o']
##a = 0
##for i in range(len(n)):
##    for j in range(len(word)):
##        if(len(n) == 5) :
##            if(n[i] == word[j]):
##                a = 0
##        else:
##            if(summ > 1):
##                if(n[i] == word[j]):
##                    a += 1
##            else:
##                a = 0
##if(a >= 1):
##    print("YES")
##elif(a == 0):
##    print("NO")

n = int(input())
while True:
    n = n + 1
    if(len(set(str(n))) == len(str(n))):
        break
print(n)
