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
from math import log10

def check_distinct(n):
    if(
        n[0] != n[1] and\
        n[0] != n[2] and\
        n[0] != n[3] and\
        n[1] != n[2] and\
        n[1] != n[3] and\
        n[2] != n[3]):
        return True
    else: return False

def num_to_list(n):
    d = int(log10(n))
    num = []

    for i in range(d, 0, -1):
        num.append(n // pow(10, i))
        n %= pow(10, i)
    
    num.append(n)
    return num

year = int(input())
year += 1

while(not check_distinct(num_to_list(year))):
    year +=1
print(year)
