#include<bits/stdc++.h>
using namespace std;
char s[110];
int ans=1e9,len;
void check(char pos){
    int res=0,tmp=0;
    for(int i=0;i<len;++i){
        if(s[i]==pos){
            res=max(res,tmp);
            tmp=0;
        }
        else tmp++;
    }
    res=max(res,tmp);
    ans=min(res,ans);
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>s;
    len=strlen(s);
    for(int i=0;i<26;++i){
        check(i+'a');
    }
    cout<<ans<<endl;
    return 0;
}

### Prompt

Please create a solution in cpp 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;
char s[110];
int ans=1e9,len;
void check(char pos){
    int res=0,tmp=0;
    for(int i=0;i<len;++i){
        if(s[i]==pos){
            res=max(res,tmp);
            tmp=0;
        }
        else tmp++;
    }
    res=max(res,tmp);
    ans=min(res,ans);
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>s;
    len=strlen(s);
    for(int i=0;i<26;++i){
        check(i+'a');
    }
    cout<<ans<<endl;
    return 0;
}

```