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
def beautifulYear():
  y = int(input())
  # lis = [int(x) for x in i]
  # i = -1
  # j = 0
  while(1):
    y += 1
    a = y // 1000
    b = y // 100 % 10
    c = y // 10 % 10
    d = y % 10
    if (a != b and a != c and a != d and b != c and b != d and c != d):
      print(y)
      break
    # lis[i] += 1
    # if(lis[i] == 9):
    #   lis[i] = 0
    #   i -= 1
    #   j += 1
    #   print('aa',lis)
    # print('bb',lis)
    # print('i and j0 ',i,j)
    # while(i<=-3 and i-j<=-3):
    #   if(i-j<-3):
    #     if(lis[i] == 9):
    #       lis[i] = 0
    #       lis[i-1] += 1
    #       print('fff',lis)
    #       print('i and j1 ',i,j)
    #       print('cc',lis)
    #       i = -1
    #       j = 0
    #   if(lis[i] != lis[i-j]):
    #     print('i and j2 ',i,j)
    #     print('dd',lis)
    #     j += 1
    #   else:
    #     if(lis[i] == 9):
    #       lis[i] = 0
    #       print('ff',lis)
    #     else:
    #       lis[i] += 1
    #     print('i and j3 ',i,j)
    #     print('ee',lis)

def main():
  beautifulYear()

if __name__ == "__main__":
    main()