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 abhi_neel() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int32_t main() {
  abhi_neel();
  int th, hu, t, o, n;
  cin >> n;
  for (int i = n + 1; i <= 9012; ++i) {
    int j = i;
    o = j % 10;
    j = j / 10;
    t = j % 10;
    j = j / 10;
    hu = j % 10;
    j = j / 10;
    th = j % 10;
    if (o != t && o != hu && o != th) {
      if (t != o && t != hu && t != th) {
        if (hu != o && hu != t && hu != th) {
          if (th != o && th != hu && th != hu) {
            cout << th << hu << t << o;
            break;
          }
        }
      }
    }
  }
  return 0;
}
