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

int main(){
  string s;
  cin >> s;
  vector<pair<int,int> > vp(26,pair<int,int>(-1,-1));
  int x;
  int N=s.size();
  for(int i=0;i<N;i++){
    x=s.at(i)-'a';
    vp.at(x).second=max(vp.at(x).second,i-vp.at(x).first-1);
    vp.at(x).first=i;
  }
  int ans=1e8;
  for(auto p:vp){
    if(p.first!=-1){
      ans=min(ans,max(p.second,N-p.first-1));
    }
  }
  cout << ans << endl;
  return 0;
}

### Prompt

In cpp, your task is to solve 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;
  vector<pair<int,int> > vp(26,pair<int,int>(-1,-1));
  int x;
  int N=s.size();
  for(int i=0;i<N;i++){
    x=s.at(i)-'a';
    vp.at(x).second=max(vp.at(x).second,i-vp.at(x).first-1);
    vp.at(x).first=i;
  }
  int ans=1e8;
  for(auto p:vp){
    if(p.first!=-1){
      ans=min(ans,max(p.second,N-p.first-1));
    }
  }
  cout << ans << endl;
  return 0;
}

```