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
y = int(input()) +1
def notdistinct(par):
	par = [par[0],par[1],par[2],par[3]]
	par = set(par)
	return len(par) != 4 
while(notdistinct(str(y))):
	y+=1
print(y)

# sol = [0,0,0,0]
# intento = 0
# while(int("".join(sol)<= y)):
# 	sol = [-1,-1,-1,-1]
# 	for a in (range(4)):
# 		if (a < intento):
# 			continue
# 		elif(a == intento):
# 			for b in range(1,10):	
# 				if(b > y[a]):
# 					sol.append(b)
# 					break
# 		else:
# 			sol.append(y[a])

# #mayor y conservan, luego menor posible