#include <iostream>
#include <string>
#include <cstring>
using namespace std;
int ans=100000;
string str;
int main(){
	cin>>str;
	for (char l='a';l<='z';l++){
		string s=str+l;
		int le=0,maxi=0;
		for (int i=0;i<s.size();i++){
			if (s[i]!=l){
				le++;
			}else{
				if (le>maxi) maxi=le;
				le=0;
			}
		}
		if (maxi<ans) ans=maxi;
	}
	cout<<ans;
	return 0;
} 
### 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 <string>
#include <cstring>
using namespace std;
int ans=100000;
string str;
int main(){
	cin>>str;
	for (char l='a';l<='z';l++){
		string s=str+l;
		int le=0,maxi=0;
		for (int i=0;i<s.size();i++){
			if (s[i]!=l){
				le++;
			}else{
				if (le>maxi) maxi=le;
				le=0;
			}
		}
		if (maxi<ans) ans=maxi;
	}
	cout<<ans;
	return 0;
} 
```