#include <cstdio>
#include <cstring>
#include <algorithm>

const int MN = 105, Sig = 26;

int N;
char S[MN];
int lst[Sig], ans[Sig];

int main() {
	scanf("%s", S + 1), N = strlen(S + 1);
	for (int i = 1; i <= N; ++i) {
		int x = S[i] - 'a';
		ans[x] = std::max(ans[x], i - lst[x] - 1);
		lst[x] = i;
	}
	int tans = N;
	for (int x = 0; x < Sig; ++x) tans = std::min(tans, std::max(ans[x], N - lst[x]));
	printf("%d\n", tans);
	return 0;
}
### Prompt

Please create a solution in cpp 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>

const int MN = 105, Sig = 26;

int N;
char S[MN];
int lst[Sig], ans[Sig];

int main() {
	scanf("%s", S + 1), N = strlen(S + 1);
	for (int i = 1; i <= N; ++i) {
		int x = S[i] - 'a';
		ans[x] = std::max(ans[x], i - lst[x] - 1);
		lst[x] = i;
	}
	int tans = N;
	for (int x = 0; x < Sig; ++x) tans = std::min(tans, std::max(ans[x], N - lst[x]));
	printf("%d\n", tans);
	return 0;
}
```