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
# https://codeforces.com/problemset/problem/271/A

import sys
#-----------------------------------------------------------------------------#
try:
    sys.stdin = open('inputs.txt', 'r')
    sys.stdout = open('output.txt', 'w')
except:
    pass
finally:
    input = sys.stdin.readline
    print = sys.stdout.write

#-----------------------------------------------------------------------------#

year1 = int(input())

year2 = year1 + 1


def next_unq(year):

    count = set()
    for j, i in enumerate(year):
        if i in count:
            break
        else:
            count.add(i)
    else:
        return year

    year = str((int(year) // 10 ** (3 - j)) * 10 ** (3 - j) + 10 ** (3 - j))

    return next_unq(year)


print(next_unq(str(year2)))
