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
#Já resolvi problema parecido, por isso o código é semelhante.
#https://vjudge.net/contest/333928#problem/B

def split(p): 
    return [int(i) for i in str(p)]
    
def saoDif(l):
    numeros = [1, 2, 3, 4, 5, 6, 7, 8, 9, 0]
    res = split(l)
    pos = 0
    tamRes = len(res)
    while(len(numeros)>0 and pos < tamRes):
        if(res[pos] in numeros):
            numeros.remove(res[pos])
        else:
            return -1
            
        pos+=1
    
    return 1

def encontreDif(l, r):
    
    for i in range(l+1, r):
        if(saoDif(i)==1):
            return i
    
    return -1
    

l = int(input())
l+=1

if(saoDif(l)==1):
    print(l)
else:
    aux = encontreDif(l, 9013)
    print(aux)

	  	 				     	 					       		