#include<bits/stdc++.h>
using namespace std;

int last[26];
char str[105];
int mx[26];
int main(){
	scanf("%s",str);
	int n = (int)strlen(str);
	for(int i=0;i<26;i++){
		last[i] = -1;
		mx[i] = -1;
	}
	for(int i=0;i<n;i++){
		int target = str[i] - 'a';
		mx[target] = max(i-last[target]-1, mx[target]);
		last[target] = i;
	}
	for(int i=0;i<26;i++){
		mx[i] = max(mx[i], n-1-last[i]);
	}
	int ans = 100000000;
	for(int i=0;i<26;i++){
		if(ans > mx[i]) ans = mx[i];
	}
	printf("%d\n",ans);
}
### Prompt

Create a solution in Cpp for 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 last[26];
char str[105];
int mx[26];
int main(){
	scanf("%s",str);
	int n = (int)strlen(str);
	for(int i=0;i<26;i++){
		last[i] = -1;
		mx[i] = -1;
	}
	for(int i=0;i<n;i++){
		int target = str[i] - 'a';
		mx[target] = max(i-last[target]-1, mx[target]);
		last[target] = i;
	}
	for(int i=0;i<26;i++){
		mx[i] = max(mx[i], n-1-last[i]);
	}
	int ans = 100000000;
	for(int i=0;i<26;i++){
		if(ans > mx[i]) ans = mx[i];
	}
	printf("%d\n",ans);
}
```