#include<bits/stdc++.h>
using namespace std;
const int N=105;
char s[N];
int flag[N],ans=1e9;
int main(){
	scanf("%s",s+1);
	int n=strlen(s+1);
	for (int i='a';i<='z';i++){
		for (int j=1;j<=n;j++)
			if (s[j]==i)flag[j]=1;
			else flag[j]=0;
		flag[n+1]=1;
		int num=0;
		for (int j=n;j;j--)
			for (int k=j;k<=n+1;k++)
				if (flag[k]){
					num=max(num,k-j);
					break;
				}
		ans=min(ans,num);		
	}
	printf("%d\n",ans);
}
### 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<bits/stdc++.h>
using namespace std;
const int N=105;
char s[N];
int flag[N],ans=1e9;
int main(){
	scanf("%s",s+1);
	int n=strlen(s+1);
	for (int i='a';i<='z';i++){
		for (int j=1;j<=n;j++)
			if (s[j]==i)flag[j]=1;
			else flag[j]=0;
		flag[n+1]=1;
		int num=0;
		for (int j=n;j;j--)
			for (int k=j;k<=n+1;k++)
				if (flag[k]){
					num=max(num,k-j);
					break;
				}
		ans=min(ans,num);		
	}
	printf("%d\n",ans);
}
```