#include<bits/stdc++.h>
using namespace std;
char s[110],a[110];
int main(){
	int n,ans=1000;
	scanf("%s",s);
	n=strlen(s);
	for(int i=0;i<26;++i){
		for(int j=0;j<n;++j)a[j]=(s[j]==i+'a');
		for(int k=0;k<n;++k){
			for(int l=0;l<n-k;++l)if(!a[l])goto nxt;
			ans=min(ans,k);break;
			nxt:for(int l=0;l<n-k;++l)a[l]=(a[l]|a[l+1]);
		}
	}
	printf("%d",ans);
}
### Prompt

Create a solution in Cpp for 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[110],a[110];
int main(){
	int n,ans=1000;
	scanf("%s",s);
	n=strlen(s);
	for(int i=0;i<26;++i){
		for(int j=0;j<n;++j)a[j]=(s[j]==i+'a');
		for(int k=0;k<n;++k){
			for(int l=0;l<n-k;++l)if(!a[l])goto nxt;
			ans=min(ans,k);break;
			nxt:for(int l=0;l<n-k;++l)a[l]=(a[l]|a[l+1]);
		}
	}
	printf("%d",ans);
}
```