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 gcd(int a, int b) { return (b == 0 ? a : gcd(b, a % b)); }
int lcm(int a, int b) {
  int temp = gcd(a, b);
  return temp ? (a * b / temp) : 0;
}
int a[10];
bool byear(int x) {
  for (int i = 0; i < 10; i++) a[i] = 0;
  while (x > 0) {
    a[x % 10]++;
    if (a[x % 10] > 1) return false;
    x /= 10;
  }
  return true;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = n + 1;; i++)
    if (byear(i)) {
      printf("%d\n", i);
      break;
    }
  return 0;
}
