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
#  Beautiful Year


def get_year(year, had):
    # print "Year: ", year, "\t", "had: ", had
    if len(year) == 1:
        a = year[0]
        for it in range(a + 1, 10):
            if it in had:
                continue
            else:
                # print it
                return [it]
        # print "None"
        return None
    a = year[0]
    it = a
    if it not in had:
        had1 = set(had)
        had1.add(it)
        x = get_year(year[1:], had1)
        if x is not None:
            # print [it] + x
            return [it] + x
    for it in range(a + 1, 10):
        if it in had:
            continue
        else:
            had1 = set(had)
            had1.add(it)
            x = get_2(len(year) - 1, had1)
            return [it] + x
        # print "None"

    return None


def get_2(n, had):
    # print "n: ", n, " had: ", had
    result = [i for i in range(10) if i not in had][:n]
    return result


if __name__ == '__main__':
    s = raw_input()
    year = [int(i) for i in s]
    x = get_year(year, set())
    # x[-1] += 1
    if x is None:
        x = []
        for i in range(len(year) + 1):
            x.append(i + 1)
    s = ""
    for i in x:
        s += str(i)
    print s
