
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=10001;
char s[maxn];
int ans[maxn],lst[maxn];
signed main()
{
	cin>>s+1;
	int len=strlen(s+1);
	for(int i=1;i<=len;i++)
	{
		ans[s[i]]=max(ans[s[i]],i-lst[s[i]]-1),lst[s[i]]=i;
	}
	int anss=1e9;
	for(int i='a';i<='z';i++)
	{
		ans[i]=max(ans[i],len-lst[i]);
		anss=min(anss,ans[i]);
	}
	cout<<anss;
    
}
/*
规则就是每次相邻二选一产生一个新的串
whbrjpjyhsrywlqjxdbrbaomnw
*/
### 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>
#define int long long
using namespace std;
const int maxn=10001;
char s[maxn];
int ans[maxn],lst[maxn];
signed main()
{
	cin>>s+1;
	int len=strlen(s+1);
	for(int i=1;i<=len;i++)
	{
		ans[s[i]]=max(ans[s[i]],i-lst[s[i]]-1),lst[s[i]]=i;
	}
	int anss=1e9;
	for(int i='a';i<='z';i++)
	{
		ans[i]=max(ans[i],len-lst[i]);
		anss=min(anss,ans[i]);
	}
	cout<<anss;
    
}
/*
规则就是每次相邻二选一产生一个新的串
whbrjpjyhsrywlqjxdbrbaomnw
*/
```