#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s[105];
int sum[105],ans,mx[105];
int main()
{
	scanf("%s",s+1);
	int len=strlen(s+1); ans=len-1;
	for(int i=1;i<=26;i++){
		int tot=0;
		for(int j=1;j<=len;j++) if(s[j]-'a'+1==i) sum[++tot]=j,mx[tot]=max(sum[tot]-sum[tot-1]-1,mx[tot-1]);
		for(int j=1;j<=tot;j++) ans=min(ans,max(mx[tot],len-sum[tot]));
	}
	printf("%d\n",ans);
}
### Prompt

Develop a solution in Cpp 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<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s[105];
int sum[105],ans,mx[105];
int main()
{
	scanf("%s",s+1);
	int len=strlen(s+1); ans=len-1;
	for(int i=1;i<=26;i++){
		int tot=0;
		for(int j=1;j<=len;j++) if(s[j]-'a'+1==i) sum[++tot]=j,mx[tot]=max(sum[tot]-sum[tot-1]-1,mx[tot-1]);
		for(int j=1;j<=tot;j++) ans=min(ans,max(mx[tot],len-sum[tot]));
	}
	printf("%d\n",ans);
}
```