#include<bits/stdc++.h>
using namespace std;
char st[2000100];
int a[2000100];
int main()
{
	scanf("%s",st+1);int len=strlen(st+1),ans=2100000000;
	for (int ch='a';ch<='z';ch++)
	{
		for (int i=1;i<=len;i++) a[i]=(st[i]==ch);
		int ths=0,l=len;
		while (1)
		{
			bool err=false;
			for (int i=1;i<=l;i++) if (a[i]==0) err=true;
			if (!err) break;
			for (int i=1;i<l;i++) a[i]=a[i]||a[i+1];l--;
			ths++;
		}
		ans=min(ans,ths);
	}
	cout<<ans<<endl;
}
### 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<bits/stdc++.h>
using namespace std;
char st[2000100];
int a[2000100];
int main()
{
	scanf("%s",st+1);int len=strlen(st+1),ans=2100000000;
	for (int ch='a';ch<='z';ch++)
	{
		for (int i=1;i<=len;i++) a[i]=(st[i]==ch);
		int ths=0,l=len;
		while (1)
		{
			bool err=false;
			for (int i=1;i<=l;i++) if (a[i]==0) err=true;
			if (!err) break;
			for (int i=1;i<l;i++) a[i]=a[i]||a[i+1];l--;
			ths++;
		}
		ans=min(ans,ths);
	}
	cout<<ans<<endl;
}
```