#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
using namespace std;
string s;
int ss;
int l,res,ans=1e9;
int main()
{
	cin>>s;
	int l=s.size();
	for(char i='a';i<='z';i++)
	{
		string st=s;
		for(int j=l;j>=0;j--)
		{
			ss=0;
			for(int k=0;k<j;k++)
			{
				if(st[k]==i)ss++;
				if(k+1<l && st[k+1]==i)st[k]=i;
			}
			if(ss==j)
			{
				ans=min(ans,l-j);break;
			}
		}
	}
	printf("%d",ans);
	return 0;
} 
### Prompt

Create a solution in Cpp for 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<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
using namespace std;
string s;
int ss;
int l,res,ans=1e9;
int main()
{
	cin>>s;
	int l=s.size();
	for(char i='a';i<='z';i++)
	{
		string st=s;
		for(int j=l;j>=0;j--)
		{
			ss=0;
			for(int k=0;k<j;k++)
			{
				if(st[k]==i)ss++;
				if(k+1<l && st[k+1]==i)st[k]=i;
			}
			if(ss==j)
			{
				ans=min(ans,l-j);break;
			}
		}
	}
	printf("%d",ans);
	return 0;
} 
```