#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char ch[111];
int a[111],n,ans=2e9;
int main()
{
	scanf("%s",ch+1);n=strlen(ch+1);
	for(int i=1;i<=n;++i)a[i]=ch[i]-97;
	for(int i=0;i<26;++i)
	{
		int mx=0,d=0;
		for(int j=n;j;--j)
			if(a[j]==i)d=0;
			else mx=max(mx,++d);
		ans=min(ans,mx);
	}
	printf("%d\n",ans);
	return 0;
}

### Prompt

Your task is to create a Cpp solution to 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<cstdio>
#include<cstring>
using namespace std;
char ch[111];
int a[111],n,ans=2e9;
int main()
{
	scanf("%s",ch+1);n=strlen(ch+1);
	for(int i=1;i<=n;++i)a[i]=ch[i]-97;
	for(int i=0;i<26;++i)
	{
		int mx=0,d=0;
		for(int j=n;j;--j)
			if(a[j]==i)d=0;
			else mx=max(mx,++d);
		ans=min(ans,mx);
	}
	printf("%d\n",ans);
	return 0;
}

```