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 allDifferent(int n) {
  set<char> digits;
  for (int i = 0; i <= 3; i++) {
    char digit = '0' + (int((n / (pow(10.0, i)))) % 10);
    if (digits.find(digit) != digits.end()) {
      return false;
    }
    digits.insert(digit);
  }
  return true;
}
int main(void) {
  int n;
  cin >> n;
  int i = n + 1;
  while (true) {
    if (allDifferent(i)) {
      break;
    }
    i++;
  }
  cout << i << endl;
  return 0;
}
