#include<iostream>
#include<cstdio>
#include<cstring>

const int N=105;
char s[N];
int n,ans;

int calc(int c)
{
	int ret=0,tmp=0;
	for(int i=1;i<=n;i++)
	{
		if(s[i]!=c)tmp++;
		else tmp=0;
		ret=std::max(ret,tmp);
	}
	return ret;
}

int main()
{
	scanf("%s",s+1);
	n=strlen(s+1);

	ans=2333;
	for(int i='a';i<='z';i++)
		ans=std::min(ans,calc(i));
	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>

const int N=105;
char s[N];
int n,ans;

int calc(int c)
{
	int ret=0,tmp=0;
	for(int i=1;i<=n;i++)
	{
		if(s[i]!=c)tmp++;
		else tmp=0;
		ret=std::max(ret,tmp);
	}
	return ret;
}

int main()
{
	scanf("%s",s+1);
	n=strlen(s+1);

	ans=2333;
	for(int i='a';i<='z';i++)
		ans=std::min(ans,calc(i));
	printf("%d\n",ans);
	return 0;
}

```