#include <bits/stdc++.h>
#define N 501
using namespace std;
int n,ans=N;char s[N];
inline int read()
{
	int x=0,c=getchar();while(c<'0'||c>'9')c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+c-48,c=getchar();return x;
}
int main()
{
	scanf("%s",s+1);n=strlen(s+1);
	for(int i=0;i<26;i++){
		int ss=0,l=0;
		for(int j=1;j<=n;j++)
			if(s[j]==i+97)ss=max(ss,j-l-1),l=j;
		if(l)ans=min(ans,max(ss,n-l));
	}
	printf("%d\n",ans);
}
### Prompt

Generate 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>
#define N 501
using namespace std;
int n,ans=N;char s[N];
inline int read()
{
	int x=0,c=getchar();while(c<'0'||c>'9')c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+c-48,c=getchar();return x;
}
int main()
{
	scanf("%s",s+1);n=strlen(s+1);
	for(int i=0;i<26;i++){
		int ss=0,l=0;
		for(int j=1;j<=n;j++)
			if(s[j]==i+97)ss=max(ss,j-l-1),l=j;
		if(l)ans=min(ans,max(ss,n-l));
	}
	printf("%d\n",ans);
}
```