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 n, a, b, arr[20], count, i, m;
  scanf("%d", &n);
  while (count != 4) {
    count = 0;
    for (i = 0; i < 20; i++) arr[i] = 0;
    m = ++n;
    while (m != 0) {
      a = m % 10;
      m = m / 10;
      if (arr[a] == 0) {
        count++;
        arr[a] = 1;
      }
    }
  }
  printf("%d", n);
  return 0;
}
