# 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


# used Bruteforcing
y = input()


def check_unique(year):
    global y
    yr = y = str(int(year) + 1)
    yr = [int(i) for i in yr]
    return len(yr) == len(set(yr))


chk = check_unique(y)
while chk is not True:
    chk = check_unique(y)
print(y)

# 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


# used Bruteforcing
y = input()


def check_unique(year):
    global y
    yr = y = str(int(year) + 1)
    yr = [int(i) for i in yr]
    return len(yr) == len(set(yr))


chk = check_unique(y)
while chk is not True:
    chk = check_unique(y)
print(y)

# 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 # used Bruteforcing