#include <iostream>
#include <vector>
using namespace std;

int main(){
    string S;
    cin >> S;
    int res = (int)S.size();//INF
    for(char c:S){
        int tmp = 0;
        for(int i = 0; i < S.size();){
            int j = i;
            while(j < S.size() && !((S[j] == c)^(S[i] == c)))++j;
            if(S[i]!=c)tmp = max(tmp,j-i);
            i = j;
        }
        res = min(res,tmp);
    }
    cout << res << endl;
}
### 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 <iostream>
#include <vector>
using namespace std;

int main(){
    string S;
    cin >> S;
    int res = (int)S.size();//INF
    for(char c:S){
        int tmp = 0;
        for(int i = 0; i < S.size();){
            int j = i;
            while(j < S.size() && !((S[j] == c)^(S[i] == c)))++j;
            if(S[i]!=c)tmp = max(tmp,j-i);
            i = j;
        }
        res = min(res,tmp);
    }
    cout << res << endl;
}
```