#include<bits/stdc++.h>
using namespace std;

char a[110];

int main()
{
	scanf("%s",a);
	int len=strlen(a),ans=INT_MAX;
	for(int i=0;i<26;i++)
	{
		a[len]='a'+i;
		a[len+1]='\0';
		int co=0;
		for(int j=len;j>=0;j--)
		{
			int th=0;
			for(;j>=0;j--)
			{
				if(a[j]=='a'+i)
				{
					break;
				}
				th++;
			}
			co=max(th,co);
		}
		ans=min(ans,co);
	}
	printf("%d\n",ans);
}

### Prompt

Develop a solution in cpp 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>
using namespace std;

char a[110];

int main()
{
	scanf("%s",a);
	int len=strlen(a),ans=INT_MAX;
	for(int i=0;i<26;i++)
	{
		a[len]='a'+i;
		a[len+1]='\0';
		int co=0;
		for(int j=len;j>=0;j--)
		{
			int th=0;
			for(;j>=0;j--)
			{
				if(a[j]=='a'+i)
				{
					break;
				}
				th++;
			}
			co=max(th,co);
		}
		ans=min(ans,co);
	}
	printf("%d\n",ans);
}

```