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

ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c*d/gcd(c,d);}
int main(){
string s;
cin>>s;
int ans=INT_MAX;
for(char c='a';c<='z';c++){
    int left=-1,res=0;
    for(int i=0;i<=s.size();i++){
     if(i==s.size())res=max(res,i-left-1);
    else{
        if(s.at(i)==c){
            res=max(res,i-left-1);
            left=i;
        }
    }
    }
    ans=min(res,ans);
}
cout<<ans<<endl;
}
### Prompt

Your task is to create 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;
using ll=long long;

ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c*d/gcd(c,d);}
int main(){
string s;
cin>>s;
int ans=INT_MAX;
for(char c='a';c<='z';c++){
    int left=-1,res=0;
    for(int i=0;i<=s.size();i++){
     if(i==s.size())res=max(res,i-left-1);
    else{
        if(s.at(i)==c){
            res=max(res,i-left-1);
            left=i;
        }
    }
    }
    ans=min(res,ans);
}
cout<<ans<<endl;
}
```