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
#include <bits/stdc++.h>
int main() {
  int y, i, j, k, l, c, a[1005], t = 0, s, p;
  scanf("%d", &y);
  for (i = 0; i <= 9; i++) {
    for (j = 0; j <= 9; j++) {
      for (k = 0; k <= 9; k++) {
        for (l = 0; l <= 9; l++) {
          c = i * 1000 + j * 100 + k * 10 + l;
          if (c > y && i != j && i != k && i != l && j != k && j != l &&
              k != l) {
            a[t] = c;
            t++;
            break;
          }
        }
      }
    }
  }
  s = a[0];
  for (p = 0; p < t; p++) {
    if (a[p] < s) {
      s = a[p];
    }
  }
  printf("%d", s);
}
