#include<cstdio>
#include<cstring>

char s[101];
int main()
{
	int i,j,c,t,ans=100;
	scanf("%s",s);
	int n=strlen(s);
	for(c='a';c<='z';c++)
	{
		for(i=0;i<n;i++)if(s[i]==c)break;
		if(i==n)continue;
		for(i=t=0;i<n;i++)
		{
			for(j=0;j<n-i;j++)
				if(s[i+j]==c)
					break;
			if(j>t)t=j;
		}
		if(t<ans)ans=t;
	}
	printf("%d\n",ans);
}
### 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<cstdio>
#include<cstring>

char s[101];
int main()
{
	int i,j,c,t,ans=100;
	scanf("%s",s);
	int n=strlen(s);
	for(c='a';c<='z';c++)
	{
		for(i=0;i<n;i++)if(s[i]==c)break;
		if(i==n)continue;
		for(i=t=0;i<n;i++)
		{
			for(j=0;j<n-i;j++)
				if(s[i+j]==c)
					break;
			if(j>t)t=j;
		}
		if(t<ans)ans=t;
	}
	printf("%d\n",ans);
}
```