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

int ans[26];
int last[26];

int main(){
	string s; cin >> s;
	memset(last, -1, sizeof(last));
	for (int i = 0; i < s.length(); i++){
		ans[s[i] - 'a'] = max(ans[s[i] - 'a'], i - last[s[i] - 'a'] - 1);
		last[s[i] - 'a'] = i;
	}
	int minj = 0x3f3f3f3f;
	for (int i = 0; i < 26; i++){
		ans[i] = max(ans[i], (int)s.length() - last[i] - 1);
		minj = min(minj, ans[i]);
	}
	cout << minj << endl;
	return 0;
}

### Prompt

Please provide a CPP coded solution 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>
using namespace std;

int ans[26];
int last[26];

int main(){
	string s; cin >> s;
	memset(last, -1, sizeof(last));
	for (int i = 0; i < s.length(); i++){
		ans[s[i] - 'a'] = max(ans[s[i] - 'a'], i - last[s[i] - 'a'] - 1);
		last[s[i] - 'a'] = i;
	}
	int minj = 0x3f3f3f3f;
	for (int i = 0; i < 26; i++){
		ans[i] = max(ans[i], (int)s.length() - last[i] - 1);
		minj = min(minj, ans[i]);
	}
	cout << minj << endl;
	return 0;
}

```