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

int main() {
	string s;cin>>s;
  	int count=0,temp=0,ans=10000;
	for(int i=0;i<26;i++){
      for(int j=0;j<s.size();j++){
    	if(s[j]==('a'+i)){
        	count=max(count,temp);
          	temp=0;
        }else{
        	temp++;
        }
      }
      count=max(count,temp); temp=0;
      ans=min(ans,count); count=0;
    }
  cout<<ans<<endl;
}
  
### 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;
  	int count=0,temp=0,ans=10000;
	for(int i=0;i<26;i++){
      for(int j=0;j<s.size();j++){
    	if(s[j]==('a'+i)){
        	count=max(count,temp);
          	temp=0;
        }else{
        	temp++;
        }
      }
      count=max(count,temp); temp=0;
      ans=min(ans,count); count=0;
    }
  cout<<ans<<endl;
}
  
```