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;
void warm_up() {}
void solve() {
  int n;
  cin >> n;
  while (++n) {
    string ns = to_string(n);
    if (ns[0] == ns[1] || ns[0] == ns[2] || ns[0] == ns[3] || ns[1] == ns[2] ||
        ns[1] == ns[3] || ns[2] == ns[3]) {
      continue;
    } else {
      cout << n << "\n";
      return;
    }
  }
}
int32_t main() {
  warm_up();
  solve();
  return 0;
}
