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
import math
import sys
def isLucky(n):
     
    # Create an array of size 10
    # and initialize all elements 
    # as false. This array is
    # used to check if a digit 
    # is already seen or not.
    ar = [False] * 10
    # print(ar)
     
    # Traverse through all digits
    # of given number
    while (n > 0):
         
        #Find the last digit
        digit = math.floor(n % 10)
 
        # If digit is already seen,
        # return false
        if (ar[digit]):
            return False
 
        # Mark this digit as seen
        ar[digit] = True
 
        # REmove the last digit
        # from number
        n = n // 10
     
    return True
    
t=int(input())
for i in range(t+1,sys.maxsize):
    # print("i=",i)
    #p=isLucky(i)
    #print("truth value=",p)
    if(isLucky(i)):
        print(i)
        break
    else:
        continue