#include<bits/stdc++.h>
using namespace std;
int main()
{
	char s[110]="";
	scanf("%s",s+1);
	int n=strlen(s+1),ans=1e9;
	for (char ch='a';ch<='z';ch++){
		int val=0;
		int last=1;
		for (int i=1;i<=n;i++)
		if (s[i]==ch){
			val=max(val,i-last);
			last=i+1;
		}
		if (last<=n) val=max(val,n+1-last);
		ans=min(ans,val);
	}
	printf("%d\n",ans);
	return 0;
}
### 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;
int main()
{
	char s[110]="";
	scanf("%s",s+1);
	int n=strlen(s+1),ans=1e9;
	for (char ch='a';ch<='z';ch++){
		int val=0;
		int last=1;
		for (int i=1;i<=n;i++)
		if (s[i]==ch){
			val=max(val,i-last);
			last=i+1;
		}
		if (last<=n) val=max(val,n+1-last);
		ans=min(ans,val);
	}
	printf("%d\n",ans);
	return 0;
}
```