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;
int num(int n) {
  int p = n % 10;
  int q = (n % 100) / 10;
  int r = (n % 1000) / 100;
  int s = n / 1000;
  unordered_set<int> us;
  us.insert(s);
  if (us.find(r) != us.end()) {
    n += 100;
    n -= (n % 100);
    return num(n);
  } else
    us.insert(r);
  if (us.find(q) != us.end()) {
    n += 10;
    n -= (n % 10);
    return num(n);
  } else
    us.insert(q);
  if (us.find(p) != us.end()) {
    n += 1;
    return num(n);
  }
  return n;
}
int main() {
  int n;
  cin >> n;
  n++;
  cout << num(n) << endl;
}
