#include <bits/stdc++.h>
using namespace std;

int main() {
  string s;
  cin >> s;
  int N = s.size();
  vector<vector<int>> ch(26);
  for (int i = 0; i < N; i++) {
    ch[s[i]-'a'].push_back(i);
  }
  int ans = N;
  for (auto v : ch) {
    int k = v.size();
    if (k == 0) continue;
    int d = max(v[0],N-1-v[k-1]);
    for (int i = 0; i < k; i++) d = max(v[i]-v[i-1]-1,d);
    ans = min(ans,d);
  }
  cout << ans << endl;
}
### Prompt

Your challenge is to write a cpp solution to the following problem:

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>
using namespace std;

int main() {
  string s;
  cin >> s;
  int N = s.size();
  vector<vector<int>> ch(26);
  for (int i = 0; i < N; i++) {
    ch[s[i]-'a'].push_back(i);
  }
  int ans = N;
  for (auto v : ch) {
    int k = v.size();
    if (k == 0) continue;
    int d = max(v[0],N-1-v[k-1]);
    for (int i = 0; i < k; i++) d = max(v[i]-v[i-1]-1,d);
    ans = min(ans,d);
  }
  cout << ans << endl;
}
```