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

signed main() {
    string S;
    cin >> S;
    int ret = 10000;
    for(int i = 0;i < 26;i++) {
        int cnt = 0;
        int cnt2 = -1;
        for(int j = 0;j < S.size();j++) {
            if(S.at(j) == 'a' + i) {
                cnt = max(cnt,j - cnt2 - 1);
              	cnt2 = j;
            }
        }
      	int A = S.size();
        cnt = max(cnt,A - cnt2 - 1);
        ret = min(ret,cnt);
    }
    cout << ret << endl;
}
### Prompt

Create a solution in CPP for 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;

signed main() {
    string S;
    cin >> S;
    int ret = 10000;
    for(int i = 0;i < 26;i++) {
        int cnt = 0;
        int cnt2 = -1;
        for(int j = 0;j < S.size();j++) {
            if(S.at(j) == 'a' + i) {
                cnt = max(cnt,j - cnt2 - 1);
              	cnt2 = j;
            }
        }
      	int A = S.size();
        cnt = max(cnt,A - cnt2 - 1);
        ret = min(ret,cnt);
    }
    cout << ret << endl;
}
```