#include <bits/stdc++.h>
#include <iterator>

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

int main() {
  string s;
  std::cin >> s;

  int minv = 101;
  for (char c : s) {
    int maxv = 0;
    rep(i, s.size()) {
      int num = 0;
      while (s[i] != c && i < s.size()) {
        i++;
        num++;
      }
      maxv = max(maxv, num);
    }
    minv = min(minv, maxv);
  }

  std::cout << minv << std::endl;

  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

Snuke can change a string t of length N into a string t' of length N - 1 under the following rule:

* For each i (1 ≤ i ≤ N - 1), the i-th character of t' must be either the i-th or (i + 1)-th character of t.



There is a string s consisting of lowercase English letters. Snuke's objective is to apply the above operation to s repeatedly so that all the characters in s are the same. Find the minimum necessary number of operations.

Constraints

* 1 ≤ |s| ≤ 100
* s consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:


s


Output

Print the minimum necessary number of operations to achieve the objective.

Examples

Input

serval


Output

3


Input

jackal


Output

2


Input

zzz


Output

0


Input

whbrjpjyhsrywlqjxdbrbaomnw


Output

8

### Response

```cpp
#include <bits/stdc++.h>
#include <iterator>

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

int main() {
  string s;
  std::cin >> s;

  int minv = 101;
  for (char c : s) {
    int maxv = 0;
    rep(i, s.size()) {
      int num = 0;
      while (s[i] != c && i < s.size()) {
        i++;
        num++;
      }
      maxv = max(maxv, num);
    }
    minv = min(minv, maxv);
  }

  std::cout << minv << std::endl;

  return 0;
}

```