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;
ifstream file("input.txt");
using namespace std;
void maker(int x);
int main() {
  int y;
  cin >> y;
  maker(y + 1);
}
void maker(int x) {
  int a, b, c, d;
  a = (x / 1000) % 10;
  b = (x / 100) % 10;
  c = (x / 10) % 10;
  d = (x / 1) % 10;
  while (a == b || a == c || a == d || b == c || b == d || c == d) {
    x++;
    a = (x / 1000) % 10;
    b = (x / 100) % 10;
    c = (x / 10) % 10;
    d = (x / 1) % 10;
  }
  cout << (a * 1000 + b * 100 + c * 10 + d);
}
