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 pow(int n, int exp) {
  int result = 1;
  if (exp == 0) return 1;
  for (int i = 0; i < exp; ++i) {
    result = result * n;
  }
  return result;
}
void year() {
  int n;
  int s;
  cin >> n;
  int arr[4];
  while (true) {
    n++;
    for (int i = 0; i < 4; ++i) {
      s = (n / pow(10, i)) % 10;
      arr[i] = s;
    }
    if (arr[0] != arr[1] and arr[0] != arr[2] and arr[0] != arr[3] and
        arr[1] != arr[2] and arr[1] != arr[3] and arr[2] != arr[3]) {
      cout << n << endl;
      break;
    }
  }
}
int main(int argc, char *argv[]) {
  year();
  return 0;
}
