#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 105;
char s[maxn];
int last[maxn], gap[maxn];
int main() {
	scanf("%s", s+1);
	int N = strlen(s+1);
	for(int i=1; i<=N; ++i) {
		int c = s[i]-'a';
		gap[c] = max(gap[c], i-last[c]-1);
		last[c] = i;
	}
	for(int c=0; c<26; ++c) 
		gap[c] = max(gap[c], N-last[c]);
	int ans = N;
	for(int c=0; c<26; ++c) 
		ans = min(ans, gap[c]);
	printf("%d\n", ans);
	return 0;
}
### Prompt

Develop a solution in Cpp to the problem described below:

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>
#include <vector>
using namespace std;
const int maxn = 105;
char s[maxn];
int last[maxn], gap[maxn];
int main() {
	scanf("%s", s+1);
	int N = strlen(s+1);
	for(int i=1; i<=N; ++i) {
		int c = s[i]-'a';
		gap[c] = max(gap[c], i-last[c]-1);
		last[c] = i;
	}
	for(int c=0; c<26; ++c) 
		gap[c] = max(gap[c], N-last[c]);
	int ans = N;
	for(int c=0; c<26; ++c) 
		ans = min(ans, gap[c]);
	printf("%d\n", ans);
	return 0;
}
```