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>
using namespace std;
int main() {
  int i, j, k, l;
  vector<int> d;
  int n, y;
  int len = 0;
  for (i = 1; i <= 8; i++) {
    for (j = 0; j <= 9; j++) {
      for (k = 0; k <= 9; k++) {
        for (l = 0; l <= 9; l++) {
          if (i != j && i != k && i != l && j != k && j != l && k != l) {
            len++;
            n = (1000 * i) + (100 * j) + (10 * k) + l;
            d.push_back(n);
          }
        }
      }
    }
  }
  y = 9012;
  d.push_back(y);
  len++;
  cin >> y;
  for (i = 0; i < len; i++) {
    if (d[i] > y) {
      cout << d[i];
      break;
    }
  }
  return 0;
}
