#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int ans;
char str[1000005];
int main()
{
	int i,j,k,l;
	scanf("%s",str); l=strlen(str);
	for(i=l;i>=1;i--)str[i]=str[i-1];
	int mi=1e9;
	for(i=0;i<26;i++)
	{
		str[l+1]='a'+i;
		ans=0;
		for(j=1;j<=l;j++)
		{
			for(k=j;k<=l+1;k++)
				if(str[k]=='a'+i)
				{
					ans=max(ans,k-j);
					break;
				}
		}
		mi=min(mi,ans);
	}
	printf("%d\n",mi);
	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
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int ans;
char str[1000005];
int main()
{
	int i,j,k,l;
	scanf("%s",str); l=strlen(str);
	for(i=l;i>=1;i--)str[i]=str[i-1];
	int mi=1e9;
	for(i=0;i<26;i++)
	{
		str[l+1]='a'+i;
		ans=0;
		for(j=1;j<=l;j++)
		{
			for(k=j;k<=l+1;k++)
				if(str[k]=='a'+i)
				{
					ans=max(ans,k-j);
					break;
				}
		}
		mi=min(mi,ans);
	}
	printf("%d\n",mi);
	return 0;
}

```