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;
const int INF = 2e9;
const int MXN = 15;
const int MXC = 1e5 + 5;
long long n, a[MXN];
bool check(long long n) {
  long long x;
  for (int i = 0; i < 10; i++) a[i] = 0;
  while (n != 0) {
    x = n % 10;
    n /= 10;
    a[x]++;
  }
  for (int i = 0; i < 10; i++) {
    if (a[i] > 1) return false;
  }
  return true;
}
int main() {
  {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  };
  cin >> n;
  n++;
  while (!check(n)) {
    n++;
  }
  cout << n << '\n';
  return 0;
}
