#include<bits/stdc++.h>

const int N = 110;

char s[N];

int main(){
	scanf("%s", s + 1);
	int len = strlen(s + 1);
	int min = INT_MAX;
	for (int i = 0; i < 26; ++ i){
		s[len + 1] = i + 'a';
		int pre = 0, max = 0;
		for (int j = 1; j <= len + 1; ++ j){
			if (s[j] == i + 'a'){
				max = std::max(max, j - pre - 1);
				pre = j;
			}
		}
		min = std::min(min, max);
	}
	return printf("%d\n", min), 0;
}
### 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>

const int N = 110;

char s[N];

int main(){
	scanf("%s", s + 1);
	int len = strlen(s + 1);
	int min = INT_MAX;
	for (int i = 0; i < 26; ++ i){
		s[len + 1] = i + 'a';
		int pre = 0, max = 0;
		for (int j = 1; j <= len + 1; ++ j){
			if (s[j] == i + 'a'){
				max = std::max(max, j - pre - 1);
				pre = j;
			}
		}
		min = std::min(min, max);
	}
	return printf("%d\n", min), 0;
}
```