#include<bits/stdc++.h>
using namespace std;
char s[105];
int last[27],mx[27];
int main(){
	scanf("%s",s+1);int n=strlen(s+1);
	for(int i=1;i<=n;i++){
		int ch=s[i]-'a';
		mx[ch]=max(mx[ch],i-last[ch]-1);
		last[ch]=i;
	}
	for(int i=0;i<26;i++) mx[i]=max(mx[i],n-last[i]); 
	int ans=1e9;
	for(int i=0;i<26;i++) ans=min(ans,mx[i]);
	printf("%d\n",ans);
	return 0;
} 
### Prompt

Please formulate a CPP solution to 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;
char s[105];
int last[27],mx[27];
int main(){
	scanf("%s",s+1);int n=strlen(s+1);
	for(int i=1;i<=n;i++){
		int ch=s[i]-'a';
		mx[ch]=max(mx[ch],i-last[ch]-1);
		last[ch]=i;
	}
	for(int i=0;i<26;i++) mx[i]=max(mx[i],n-last[i]); 
	int ans=1e9;
	for(int i=0;i<26;i++) ans=min(ans,mx[i]);
	printf("%d\n",ans);
	return 0;
} 
```