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, sum, rem, rem1, sum1;
  scanf("%d", &n);
  n = n + 1;
  while (n > 0) {
    int temp = n;
    while (temp > 0) {
      rem = temp % 10;
      temp /= 10;
      sum = temp % 10;
      temp /= 10;
      rem1 = temp % 10;
      temp /= 10;
      sum1 = temp % 10;
      temp /= 10;
    }
    if (rem == sum || rem == rem1 || rem == sum1 || sum == rem1 ||
        sum == sum1 || rem1 == sum1) {
      n++;
    } else
      goto jump;
  }
jump:
  printf("%d", n);
  return 0;
}
