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;
bool condition(int year) {
  int year_arr[4];
  int boo;
  for (int i = 3; i >= 0; i--) {
    year_arr[i] = year % 10;
    year = year / 10;
  }
  if (year_arr[0] == year_arr[1] || year_arr[0] == year_arr[2] ||
      year_arr[0] == year_arr[3] || year_arr[1] == year_arr[2] ||
      year_arr[1] == year_arr[3] || year_arr[2] == year_arr[3]) {
    boo = false;
  } else {
    boo = true;
  }
  return boo;
}
int main() {
  int prev_y, next_y;
  cin >> prev_y;
  next_y = prev_y + 1;
  while (condition(next_y) == false) {
    next_y += 1;
  }
  cout << next_y;
}
