#include<bits/stdc++.h>
using namespace std;
char s[10000];
int use[70];
int lst[70];
bool vis[70]; 
int main()
{
	scanf("%s",s+1);
	int len=strlen(s+1);
	for(int i=1;i<=len;i++)
	{
		int x=s[i]-'a'+1;
		use[x]=max(use[x],i-lst[x]-1);
		lst[x]=i;
		vis[x]=1;
	}
	for(int i=0;i<=26;i++)
		use[i]=max(use[i],len-lst[i]);
	int ans=10000;
	for(int i=1;i<=26;i++)
		if(vis[i]) ans=min(ans,use[i]);
	printf("%d",ans);
	return 0;
}
### Prompt

Please create a solution in CPP 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>
using namespace std;
char s[10000];
int use[70];
int lst[70];
bool vis[70]; 
int main()
{
	scanf("%s",s+1);
	int len=strlen(s+1);
	for(int i=1;i<=len;i++)
	{
		int x=s[i]-'a'+1;
		use[x]=max(use[x],i-lst[x]-1);
		lst[x]=i;
		vis[x]=1;
	}
	for(int i=0;i<=26;i++)
		use[i]=max(use[i],len-lst[i]);
	int ans=10000;
	for(int i=1;i<=26;i++)
		if(vis[i]) ans=min(ans,use[i]);
	printf("%d",ans);
	return 0;
}
```