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
def mCheckInputs(year):
    temp = year.pop()
    if (temp.isdigit() and (1_000 <= int(temp) <= 9_000)):
        year.append(int(temp))
    else:
        exit(1)

def mHandleInputs(inputList):
    year = [input()]
    mCheckInputs(year)
    inputList.append(year[0])

def mDoWork(inputList,outputList):
    result = 0
    year = inputList[0]
    for i in range(1,pow(10,9)):
        if isDistinct(f"{year+i}"):
            outputList.append(year+i)
            return
  
def isDistinct(x):
    numbersList = [0,1,2,3,4,5,6,7,8,9]

    for item in numbersList:
        if (x.count(str(item)) > 1 ):
            return False

    return True

def mReFormat(outputList):
    print(outputList[0])

def main():

    inputList = [] 
    mHandleInputs(inputList)

    outputList = []
    mDoWork(inputList,outputList)

    mReFormat(outputList)

if __name__ == "__main__":
    main()