#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int main(){
	char s[101];
	scanf("%s",s);
	int l = strlen(s);
	int ans = 10000;
	for(char c='a';c<='z';c++){
		int cnt = 0;
		int t = 0;
		for(int i=0;i<=l;i++){
			if(i==l||s[i]==c){
				t = max(t,cnt);
				cnt = 0;
			}else{
				cnt++;
			}
		}
		ans = min(ans,t);
	}
	printf("%d\n",ans);
}

### Prompt

Generate 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<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int main(){
	char s[101];
	scanf("%s",s);
	int l = strlen(s);
	int ans = 10000;
	for(char c='a';c<='z';c++){
		int cnt = 0;
		int t = 0;
		for(int i=0;i<=l;i++){
			if(i==l||s[i]==c){
				t = max(t,cnt);
				cnt = 0;
			}else{
				cnt++;
			}
		}
		ans = min(ans,t);
	}
	printf("%d\n",ans);
}

```