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 main() {
  int count = 0;
  char k[4];
  cin >> k;
  int a[5];
  for (int i = 0; i < 4; i++) {
    a[i] = k[i] - '0';
  }
  int b[5];
  for (int i = 0; i < 4; i++) {
    b[i] = a[i];
  }
  while (1) {
    if (b[3] == 9) {
      b[3] = 0;
      if (b[2] == 9) {
        b[2] = 0;
        if (b[1] == 9) {
          b[1] = 0;
          b[0] = b[0] + 1;
        } else
          b[1] = b[1] + 1;
      } else
        b[2] = b[2] + 1;
    } else
      b[3] = b[3] + 1;
    int i = 0;
    for (int v = 0; v < 4; v++)
      for (int z = v + 1; z < 4; z++) {
        if (b[v] == b[z]) count++;
      }
    if (count == 0)
      break;
    else
      count = 0;
  }
  for (int m = 0; m < 4; m++) {
    cout << b[m];
  }
}
