//Let Our Voices Echo
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MAX=2e5+9;
int main()
{
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	string s;
	cin>>s;
	int res=1e9;
	for (int j='a';j<='z';j++)
	{	
		int ls=-1,ans=0;
		for (int i=0;i<(int)s.size();i++)
			if (s[i]==j)
			{
				ans=max(ans,i-ls-1);
				ls=i;
				res=min(res,max(ans,(int)s.size()-i-1));
			}
	}
	cout<<res;
	return 0;
}
### Prompt

Construct a Cpp code solution to the problem outlined:

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
//Let Our Voices Echo
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MAX=2e5+9;
int main()
{
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	string s;
	cin>>s;
	int res=1e9;
	for (int j='a';j<='z';j++)
	{	
		int ls=-1,ans=0;
		for (int i=0;i<(int)s.size();i++)
			if (s[i]==j)
			{
				ans=max(ans,i-ls-1);
				ls=i;
				res=min(res,max(ans,(int)s.size()-i-1));
			}
	}
	cout<<res;
	return 0;
}
```