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
"""
Problem Statement: https://codeforces.com/problemset/problem/271/A
Author: striker
"""

LIMIT = 9100

def check_distinct_digit(number: int) -> bool:
    has_distinct_digit = True
    digit_visited = set()
    while number:
        if (number % 10) in digit_visited:
            has_distinct_digit = False
            break
        digit_visited.add(number % 10)
        number //= 10
    return has_distinct_digit

def compute_distinct_year(year: int) -> int:
    for yr in range(year + 1, LIMIT):
        if check_distinct_digit(yr):
            distinct_year = yr
            break
    return distinct_year

def main():
    print(compute_distinct_year(int(input().strip())))

if __name__ == "__main__":
    main()
