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 kiemtra(long long n) {
  if (n == 0) {
    return 0;
  } else {
    {
      long long dem[18], i = 1;
      for (long long j = 0; j <= 10; j++) {
        dem[j] = 0;
      }
      while (n > 0 && i > 0) {
        {
          if (dem[n % 10] > 0) {
            i = 0;
            break;
          }
          if (dem[n % 10] == 0) {
            dem[n % 10]++;
          }
        }
        n = n / 10;
      }
      return i;
    }
  }
}
int main() {
  long long n;
  cin >> n;
  n++;
  while (kiemtra(n) < 1) {
    n++;
  }
  cout << n << endl;
  return 0;
}
