#include <algorithm>
#include <iostream>
#include <string>

using namespace std;

int main () {
  int ans = 1e8;
  string s; cin >> s;

  for (int i = 0; i < s.length(); i++) {
    char cur = s[i];
    int t = 0;
    int d = 0;

    for (int j = i+1; j < s.length(); j++) {
      t++;
      if (s[j] == cur) {
        t = 0;
      }
      d = max(d, t);
    }
    ans = min( ans, max(i, d) );
  }

  cout << ans << 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 <algorithm>
#include <iostream>
#include <string>

using namespace std;

int main () {
  int ans = 1e8;
  string s; cin >> s;

  for (int i = 0; i < s.length(); i++) {
    char cur = s[i];
    int t = 0;
    int d = 0;

    for (int j = i+1; j < s.length(); j++) {
      t++;
      if (s[j] == cur) {
        t = 0;
      }
      d = max(d, t);
    }
    ans = min( ans, max(i, d) );
  }

  cout << ans << endl;

  return 0;
}
```