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 sys

def input():    return sys.stdin.readline().strip()
def iinput():   return int(input())
def rinput():   return map(int, sys.stdin.readline().strip().split()) 
def get_list(): return list(map(int, sys.stdin.readline().strip().split())) 


n=int(input())
#l=list(n)
#print(l)
#for i in range(len(l)):
    #for j in range(len(l)):
        #if(l[i]!=l[j]):
            #n=n+1


while(1):
    n+=1
    a = n % 10
    a1=n/10  
    b = int(a1 % 10)
    b1=a1/10   
    c =int( b1 % 10)
    c1=b1/10   
    d = int(c1 % 10)
    if(a != b and a != c and a != d and b != c and b != d and c != d):
        break
print(n)
          
    



