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 main() {
  int n, i, z, mil = 0, dec = 0, uni = 0, cent = 0;
  scanf("%d", &n);
  for (i = n + 1; i <= 10000; i++) {
    mil = i / 1000;
    cent = (i % 1000) / 100;
    dec = ((i % 1000) % 100) / 10;
    uni = (((i % 1000) % 100) % 10);
    if (uni != dec and uni != cent and uni != mil) {
      if (dec != cent and dec != mil) {
        if (cent != mil) {
          printf("%d", i);
          return 0;
        }
      }
    }
    mil = 0;
    dec = 0;
    uni = 0;
    cent = 0;
  }
  return 0;
}
