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 countdistinct(int n) {
  int ab[10] = {0};
  int count = 0;
  while (n != 0) {
    int r = n % 10;
    ab[r] = 1;
    n = n / 10;
  }
  for (int i = 0; i < 10; i++) {
    if (ab[i] == 1) {
      count++;
    }
  }
  return count;
}
int countdigits(int n) {
  int c = 0;
  while (n != 0) {
    c++;
    n = n / 10;
  }
  return c;
}
int countdistinctno(int n) {
  while (n < INT_MAX) {
    int distinctdigits = countdistinct(n + 1);
    int total_digits = countdigits(n + 1);
    if (distinctdigits == total_digits) {
      return n + 1;
    } else {
      n++;
    }
  }
  return -1;
}
int main() {
  int n;
  cin >> n;
  cout << countdistinctno(n) << endl;
}
