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, t = input().split(" ")
# a = input()
# n = int(n)
# t = int(t)
# s = list(a)

# while(t != 0):
#     for i in range(n-1):
#         if s[i] == 'B' and s[i+1] == 'G':
#             s[i] = 'G'
#             s[i + 1] = 'B'
#             t -= 1
#             break

# print("".join(s))

# t = int(input()[2:])
# s = input()
# while t:
#     s = s.replace('BG', 'GB')
#     t -= 1
#     print(s)
# print(s)

# n = input
# c = p = 0
# for i in' '*int(n()):
#     s = n()
#     c += s != p
#     p = s
# print(c)

# s = input()
# d = {".": "0", "-.": "1", "--": "2"}
# s = s.replace("--", "2")
# s = s.replace("-.", "1")
# s = s.replace(".", "0")
# print(s)

y = int(input())

while(True):
    y += 1
    if len(set(str(y))) == 4:
        break
print(y)
