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
n = int (input())
while (n >= 1000 & n <= 9000):
    n+=1
    a,d1 = divmod(n,10)
    a,d2 = divmod(a,10)
    a,d3 = divmod(a,10)
    a,d4 = divmod(a,10)
    if ( (d1 != d2) & (d1 != d3) & (d1 != d4) & (d2 != d3) & (d2 != d4) & (d3!= d4)):
        print (n)
        break;
