#include <cmath>
#include <iostream>
#include <string>
using namespace std;

int main() {
	string s;
	cin >> s;
	int n[26] = {};
	int m[26] = {};
	for (int i = 0; i < s.length(); i++) {
		for (int j = 0; j < 26; j++) {
			if (s[i] - 'a' == j) {
				m[j] = max(m[j], n[j]);
				n[j] = 0;
			} else {
				n[j]++;
			}
		}
	}
	for (int i = 0; i < 26; i++) {
		m[i] = max(m[i], n[i]);
	}
	int r = m[0];
	for (int i = 1; i < 26; i++) {
		r = min(r, m[i]);
	}
	cout << r << endl;
	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 <cmath>
#include <iostream>
#include <string>
using namespace std;

int main() {
	string s;
	cin >> s;
	int n[26] = {};
	int m[26] = {};
	for (int i = 0; i < s.length(); i++) {
		for (int j = 0; j < 26; j++) {
			if (s[i] - 'a' == j) {
				m[j] = max(m[j], n[j]);
				n[j] = 0;
			} else {
				n[j]++;
			}
		}
	}
	for (int i = 0; i < 26; i++) {
		m[i] = max(m[i], n[i]);
	}
	int r = m[0];
	for (int i = 1; i < 26; i++) {
		r = min(r, m[i]);
	}
	cout << r << endl;
	return 0;
}

```