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

int main(){
	string s;
	cin >> s;
	int l=s.size();
	
	vector<bool> exist(26,false);
	for(int i=0;i<l;i++)exist[s[i]-'a']=true;
	
	int ans=l;
	
	for(int i=0;i<26;i++){
		if(!exist[i])continue;
		char t='a'+i;
		int tmp=0;
		int c=0;
		for(int j=0;j<l;j++){
			if(s[j]!=t)c++;
			else{
				tmp=max(tmp,c);
				c=0;
			}
		}
		tmp=max(tmp,c);
		ans=min(ans,tmp);
	}
	cout << ans << endl;
	return 0;
}
### Prompt

Construct a Cpp code solution to the problem outlined:

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 l=s.size();
	
	vector<bool> exist(26,false);
	for(int i=0;i<l;i++)exist[s[i]-'a']=true;
	
	int ans=l;
	
	for(int i=0;i<26;i++){
		if(!exist[i])continue;
		char t='a'+i;
		int tmp=0;
		int c=0;
		for(int j=0;j<l;j++){
			if(s[j]!=t)c++;
			else{
				tmp=max(tmp,c);
				c=0;
			}
		}
		tmp=max(tmp,c);
		ans=min(ans,tmp);
	}
	cout << ans << endl;
	return 0;
}
```