#include<bits/stdc++.h>
using namespace std;
const int maxn=205;
int n,ans,last[maxn],f[maxn];
char ch[maxn];
int main()
{
	scanf("%s",ch);
	n=strlen(ch);
	memset(last,-1,sizeof(last));
	for (int i=0;i<n;i++)
	{
		int c=ch[i]-'a';
		f[c]=max(f[c],i-last[c]-1);
		last[c]=i;
	}
	for (int i=0;i<26;i++) f[i]=max(f[i],n-last[i]-1);
	ans=n;
	for (int i=0;i<26;i++) ans=min(ans,f[i]);
	printf("%d",ans);
	return 0;
}

### Prompt

In cpp, your task is to solve 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<bits/stdc++.h>
using namespace std;
const int maxn=205;
int n,ans,last[maxn],f[maxn];
char ch[maxn];
int main()
{
	scanf("%s",ch);
	n=strlen(ch);
	memset(last,-1,sizeof(last));
	for (int i=0;i<n;i++)
	{
		int c=ch[i]-'a';
		f[c]=max(f[c],i-last[c]-1);
		last[c]=i;
	}
	for (int i=0;i<26;i++) f[i]=max(f[i],n-last[i]-1);
	ans=n;
	for (int i=0;i<26;i++) ans=min(ans,f[i]);
	printf("%d",ans);
	return 0;
}

```