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>
int btf(int n) {
  static int num[10];
  memset(num, 0, sizeof(num));
  for (int i = 0; i < 4; i++) {
    num[n % 10]++;
    n /= 10;
  }
  for (int i = 0; i < 10; i++)
    if (num[i] > 1) return 0;
  return 1;
}
void solve(int n) {
  for (int i = n + 1; 1; i++)
    if (btf(i)) {
      printf("%d\n", i);
      return;
    }
}
int main() {
  int n;
  while (scanf("%d", &n) != EOF) solve(n);
  return 0;
}
