#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
  string s;
  cin>>s;
  map<char,pair<int,int>> A;
  for(char c='a';c<='z';c++)
    A[c]=make_pair(0,-1);
  for(int i=0;i<(int)s.size();i++){
    A[s[i]].first=max(A[s[i]].first,i-A[s[i]].second-1);
    A[s[i]].second=i;
  }
  int i=1000;
  for(pair<int,pair<int,int>> p:A)
    i=min(max(p.second.first,(int)s.size()-p.second.second-1),i);
  cout<<i<<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<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
  string s;
  cin>>s;
  map<char,pair<int,int>> A;
  for(char c='a';c<='z';c++)
    A[c]=make_pair(0,-1);
  for(int i=0;i<(int)s.size();i++){
    A[s[i]].first=max(A[s[i]].first,i-A[s[i]].second-1);
    A[s[i]].second=i;
  }
  int i=1000;
  for(pair<int,pair<int,int>> p:A)
    i=min(max(p.second.first,(int)s.size()-p.second.second-1),i);
  cout<<i<<endl;
}
```