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 re
def gcd(x, y):
	while(y):
		x, y = y, x % y
	return x
def lcm(x,y):
	return (x*y)/gcd(x,y)
lucky_nums = [4,7,44,47,74,77]
def gen(num):
	for ans in range(num+1,num+1000):
		set_nums = set(str(ans))
		if len(set_nums)==4:
			return ans


def main():
	# nums = []
	nums = int(raw_input())
	# nums = map(lambda x: int(x),nums)
	#nums = [int(raw_input()) for t in range(0,5)]
	print gen(nums)

if __name__ == "__main__":
	# while True:
	# 	main()
	main()