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 n[4], i = 0, y, r, j = 0, tem;
  scanf("%d", &y);
  tem = y;
  tem = tem + 1;
  if (y >= 1000 && y <= 9000) {
    for (i = tem;; i++) {
      y = tem;
      while (tem != 0) {
        n[j] = tem % 10;
        tem = tem / 10;
        j++;
      }
      j = 0;
      if ((n[j] != n[j + 1]) && (n[j] != n[j + 2]) && (n[j + 1] != n[j + 3]) &&
          (n[j + 1] != n[j + 2]) && (n[j + 2] != n[j + 3]) &&
          (n[j] != n[j + 3])) {
        printf("%d", y);
        break;
      } else
        tem = y + 1;
      continue;
    }
  }
  return 0;
}
