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 countd(long long m) {
  long long c = 0;
  while (m != 0) {
    long long k = m % 10;
    c++;
    m /= 10;
  }
  return c;
}
int distinct(long long m) {
  long long arr[10] = {0};
  while (m != 0) {
    long long c = m % 10;
    arr[c] = 1;
    m = m / 10;
  }
  long long count = 0;
  for (long long j = 0; j < 10; j++) {
    if (arr[j]) {
      count++;
    }
  }
  return count;
}
long long nextd(long long n) {
  while (n < INT_MAX) {
    int d = distinct(n + 1);
    int d1 = countd(n + 1);
    if (d == d1) {
      return n + 1;
    } else {
      n++;
    }
  }
  return -1;
}
int main() {
  long long n;
  cin >> n;
  cout << nextd(n);
  return 0;
}
