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;
bool check(long long int y) {
  long long int i = 0;
  long long int b[9], str[10];
  for (long long int i = 0; i <= 9; i++) {
    b[i] = 0;
    str[i] = 0;
  }
  while (y > 0) {
    b[i] = y % 10;
    str[b[i]]++;
    y = y / 10;
    i++;
  }
  for (long long int i = 0; i <= 9; i++) {
    if (str[i] > 1) {
      return false;
    }
  }
  return true;
}
int main() {
  long long int n, i;
  cin >> n;
  for (i = n + 1; i <= 1000000; i++) {
    if (check(i)) {
      break;
    }
  }
  cout << i << endl;
  return 0;
}
