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 a1, a2, a3, a4, n;
int main() {
  cin >> n;
  n = n + 1;
  a1 = n / 1000 % 10;
  a2 = n / 100 % 10;
  a3 = n / 10 % 10;
  a4 = n % 10;
  if ((a1 != a2) && (a1 != a3) && (a1 != a4) && (a2 != a3) && (a2 != a4) &&
      (a3 != a4) && (n < 9000) && (n))
    cout << n << endl;
  else
    while ((a1 == a2) || (a1 == a3) || (a1 == a4) || (a2 == a3) || (a2 == a4) ||
           (a3 == a4)) {
      n++;
      a1 = n / 1000 % 10;
      a2 = n / 100 % 10;
      a3 = n / 10 % 10;
      a4 = n % 10;
      if ((a1 != a2) && (a1 != a3) && (a1 != a4) && (a2 != a3) && (a2 != a4) &&
          (a3 != a4))
        cout << n << endl;
    }
  return 0;
}
