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 a, b, c, d, n;
int cek(int x) {
  d = x % 10;
  c = ((x % 100) - d) / 10;
  b = ((x % 1000) - (x % 100)) / 100;
  a = ((x % 10000) - (x % 1000)) / 1000;
  if (a != b && a != c && a != d && b != c && b != d && c != d)
    return x;
  else
    return 0;
}
int main() {
  cin >> n;
  for (int i = n + 1; i <= 9999; i++) {
    if (cek(i) != 0) {
      cout << i;
      break;
    }
  }
}
