#include<bits/stdc++.h>
using namespace std;
int l,i,j,len,ans;
char s[102],s1[102],s2[102],c;
bool fl;
int main(){
	scanf("%s",s),l=strlen(s);
	ans=1e9;
	for (c='a';c<='z';c++){
		memcpy(s2,s,sizeof(s));
		len=l;
		for (j=0;;j++){
			fl=1;
			for (i=0;i<len && fl;i++)
				if (s2[i]!=c) fl=0;
			if (fl) break;
			swap(s1,s2);
			for (i=0;i<len-1;i++)
				if (s1[i]==c || s1[i+1]==c) s2[i]=c;
				else s2[i]=s1[i];
			len--;
		}
		ans=min(ans,j);
	}
	printf("%d",ans);
}
### Prompt

Your challenge is to write 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;
int l,i,j,len,ans;
char s[102],s1[102],s2[102],c;
bool fl;
int main(){
	scanf("%s",s),l=strlen(s);
	ans=1e9;
	for (c='a';c<='z';c++){
		memcpy(s2,s,sizeof(s));
		len=l;
		for (j=0;;j++){
			fl=1;
			for (i=0;i<len && fl;i++)
				if (s2[i]!=c) fl=0;
			if (fl) break;
			swap(s1,s2);
			for (i=0;i<len-1;i++)
				if (s1[i]==c || s1[i+1]==c) s2[i]=c;
				else s2[i]=s1[i];
			len--;
		}
		ans=min(ans,j);
	}
	printf("%d",ans);
}
```