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.
The single line contains integer *y* (1000 ≤ *y* ≤ 9000) — the year number.
'''
Attempt at codeforces 271A

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.

'''

def is_distinct(year: str) -> bool:
    #If there is a character that shows up more than once, false.
    for char in year:
        if year.count(char) > 1:
            return False
    return True

def main() -> None:
    y = input()
    search_start = str(int(y) + 1)
    while not is_distinct(search_start):
        search_start = int(search_start)
        search_start += 1
        search_start = str(search_start)
    print(search_start)

main()