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.
The single line contains integer *y* (1000 ≤ *y* ≤ 9000) — the year number.
import sys 

INT_MAX = sys.maxsize;
def countDistinct(n): 

	
	arr = [0] * 10; 
	count = 0; 

	
	while (n != 0): 
		r = int(n % 10); 
		arr[r] = 1; 
		n //= 10; 
	
	
	for i in range(10): 
		if (arr[i] != 0): 
			count += 1; 
	
	return count; 


def countDigit(n): 
	c = 0; 

	# Iterate over the digits of the number 
	while (n != 0): 
		r = n % 10; 
		c+=1; 
		n //= 10; 
	
	return c; 


def nextNumberDistinctDigit(n): 
	while (n < INT_MAX): 

		 
		distinct_digits = countDistinct(n + 1); 

		 
		total_digits = countDigit(n + 1); 

		if (distinct_digits == total_digits): 

			
			return n + 1; 
		else: 

			 
			n += 1; 
	
	return -1; 

 
if __name__ == '__main__': 
	n = int(input()); 

	print(nextNumberDistinctDigit(n)); 

	print(nextNumberDistinctDigit(n)); 