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, d1, d2, d3, d4, x, flag1 = 1, flag2 = 1, flag3 = 1, ans, i;
  scanf("%d", &n);
  for (i = n + 1; i < 9999; i++) {
    x = i;
    d1 = x % 10;
    x = x / 10;
    d2 = x % 10;
    x = x / 10;
    d3 = x % 10;
    x = x / 10;
    d4 = x;
    if (d1 != d2 && d1 != d3 && d1 != d4)
      flag1 = 1;
    else
      flag1 = 0;
    if (d2 != d1 && d2 != d3 && d2 != d4)
      flag2 = 1;
    else
      flag2 = 0;
    if (d3 != d1 && d3 != d2 && d3 != d4)
      flag3 = 1;
    else
      flag3 = 0;
    if (flag1 == 1 && flag2 == 1 && flag3 == 1) {
      ans = i;
      break;
    }
  }
  printf("%d\n", ans);
  return 0;
}
