#include <iostream>
using namespace std;
string s;
int mn=99, a[30], m[30];
int main() {
	int i, t;
	cin>>s;
	s = '.'+s;
	for(i=1; s[i]; i++) {
		t = s[i]-'a';
		m[t] = max(m[t], i-a[t]-1);
		a[t] = i;
	}
	for(i=0; i<26; i++) mn = min(mn, max(m[i], (int)s.size()-a[i]-1));
	cout<<mn;
	return 0;
}
### Prompt

Your task is to create a cpp solution 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 <iostream>
using namespace std;
string s;
int mn=99, a[30], m[30];
int main() {
	int i, t;
	cin>>s;
	s = '.'+s;
	for(i=1; s[i]; i++) {
		t = s[i]-'a';
		m[t] = max(m[t], i-a[t]-1);
		a[t] = i;
	}
	for(i=0; i<26; i++) mn = min(mn, max(m[i], (int)s.size()-a[i]-1));
	cout<<mn;
	return 0;
}
```