#include<iostream>
#include<vector>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
//12:34
int main(){
	string s;
	cin>>s;
	int head,cnt,max,min=s.size();
	for(char c='a';c<='z';c++){
		head=0;
		cnt=0;
		max=0;
		while(head<s.size()){
			if(s[head]==c){
				cnt=0;
			}else{
				cnt+=1;
				if(max<cnt)max=cnt;
			}
			head++;
		}
		if(min>max)min=max;
	}
	cout<<min<<endl;
	return 0;
}
### Prompt

Please provide a cpp coded solution 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<vector>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
//12:34
int main(){
	string s;
	cin>>s;
	int head,cnt,max,min=s.size();
	for(char c='a';c<='z';c++){
		head=0;
		cnt=0;
		max=0;
		while(head<s.size()){
			if(s[head]==c){
				cnt=0;
			}else{
				cnt+=1;
				if(max<cnt)max=cnt;
			}
			head++;
		}
		if(min>max)min=max;
	}
	cout<<min<<endl;
	return 0;
}
```