#include<bits/stdc++.h>
using namespace std;
int main(){
  string s;cin>>s;
  int ans=1000000000;
  for(int i=0;i<26;i++){
    char ch=i+'a';
    vector<int> v;
    for(int j=0;j<s.size();j++){
      if(s[j]==ch)v.push_back(j);
    }
    if(v.size()==0)continue;
    int sum=v[0];
    for(int j=0;j<v.size()-1;j++){
      sum=max(sum,v[j+1]-v[j]-1);
    }
    int u=s.size()-1-v[v.size()-1];
    sum=max(sum,u);
    ans=min(ans,sum);
  }
  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 ans=1000000000;
  for(int i=0;i<26;i++){
    char ch=i+'a';
    vector<int> v;
    for(int j=0;j<s.size();j++){
      if(s[j]==ch)v.push_back(j);
    }
    if(v.size()==0)continue;
    int sum=v[0];
    for(int j=0;j<v.size()-1;j++){
      sum=max(sum,v[j+1]-v[j]-1);
    }
    int u=s.size()-1-v[v.size()-1];
    sum=max(sum,u);
    ans=min(ans,sum);
  }
  cout<<ans<<endl;
}
```