#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<map>
using namespace std;
int main() {
  int ans=1e9;
  string s;
  cin >> s;
  
  for(char a=0 ; a<='z'; a++) {
    
    int n=0,k=s.size();
    
    for(int i=s.size()-1; i>=0; i--) {
      if(s[i]==a) {
        k=i;
      }
      n=max(n,k-i);
    }
    ans=min(ans,n);
  }
  cout << ans << 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<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<map>
using namespace std;
int main() {
  int ans=1e9;
  string s;
  cin >> s;
  
  for(char a=0 ; a<='z'; a++) {
    
    int n=0,k=s.size();
    
    for(int i=s.size()-1; i>=0; i--) {
      if(s[i]==a) {
        k=i;
      }
      n=max(n,k-i);
    }
    ans=min(ans,n);
  }
  cout << ans << endl;
}

```