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;
long long findele(long long arr[], long long s, long long e, long long q) {
  long long mid = (s + e) / 2;
  if (arr[mid] > q)
    findele(arr, 0, mid - 1, q);
  else if (arr[mid] < q)
    return mid;
  else if (arr[mid] == q)
    return mid;
  if (mid == 0) return -1;
  if (mid == e - 1) return -2;
}
int main() {
  int n;
  cin >> n;
  int x;
  bool f = 0;
  n++;
  while (true) {
  aya:
    x = n;
    while (n > 0) {
      int mod = n % 10;
      n /= 10;
      string num = to_string(n);
      string a = to_string(mod);
      if (num.find(a) != string::npos) {
        n = x;
        n++;
        f = 0;
        goto aya;
      } else {
        n = stoi(num);
        f = 1;
        continue;
      }
    }
    if (f == 1) {
      cout << x << endl;
      break;
    }
  }
  return 0;
}
