#include <bits/stdc++.h>
#define N 1005
using namespace std;
char s[N];
int n,R[N][30];
int main() {
	scanf("%s",s+1); n = strlen(s+1);
	for (int _=n;_>=1;_--) {
		for (int i=1;i<=26;i++) R[_][i] = R[_+1][i];
		R[_][s[_]-'a'+1] = _;
	}
	
	int ans = 2147483647;
	for (int _=1;_<=26;_++) {
		int cur = -1;
		for (int i=1;i<=n;i++) {
			int t = n-i+1;
			if (R[i][_]) t = min(t, R[i][_] - i);
			cur = max(cur, t);
		}
		ans = min(ans, cur);
	}
	cout << ans << endl;
	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 <bits/stdc++.h>
#define N 1005
using namespace std;
char s[N];
int n,R[N][30];
int main() {
	scanf("%s",s+1); n = strlen(s+1);
	for (int _=n;_>=1;_--) {
		for (int i=1;i<=26;i++) R[_][i] = R[_+1][i];
		R[_][s[_]-'a'+1] = _;
	}
	
	int ans = 2147483647;
	for (int _=1;_<=26;_++) {
		int cur = -1;
		for (int i=1;i<=n;i++) {
			int t = n-i+1;
			if (R[i][_]) t = min(t, R[i][_] - i);
			cur = max(cur, t);
		}
		ans = min(ans, cur);
	}
	cout << ans << endl;
	return 0;
}
```