#include<bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
#define fi first
#define se second
#define mk make_pair
using namespace std;
int main(){
  string s;
  int sum=1e9;
  cin>>s;
  for(int i=0;i<26;i++){
    char c=i+'a';
    int w=0,p=0;
    string t=s;
    t+=c;
    for(int j=0;j<t.size();j++){
      if(t[j]==c){
        w=max(w,p);
        p=0;
      }
      else p++;
    }
    sum=min(w,sum);
  }
  cout<<sum<<endl;
}
### 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>
#define r(i,n) for(int i=0;i<n;i++)
#define fi first
#define se second
#define mk make_pair
using namespace std;
int main(){
  string s;
  int sum=1e9;
  cin>>s;
  for(int i=0;i<26;i++){
    char c=i+'a';
    int w=0,p=0;
    string t=s;
    t+=c;
    for(int j=0;j<t.size();j++){
      if(t[j]==c){
        w=max(w,p);
        p=0;
      }
      else p++;
    }
    sum=min(w,sum);
  }
  cout<<sum<<endl;
}
```