#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>

int main() {
	std::string s;
	std::cin >> s;

	int ans = 1e9;
	for (char c = 'a'; c <= 'z'; c++) {
		int prev = -1;
		int len = 0;
		for (int i = 0; i < s.size(); i++) {
			if (s[i] == c) {
				len = std::max(len, i - prev - 1);
				prev = i;
			}
		}
		if (prev != -1) {
			len = std::max<int>(len, s.size() - prev - 1);
			ans = std::min(ans, len);
		}
	}
	std::cout << ans << std::endl;
}

### 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>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>

int main() {
	std::string s;
	std::cin >> s;

	int ans = 1e9;
	for (char c = 'a'; c <= 'z'; c++) {
		int prev = -1;
		int len = 0;
		for (int i = 0; i < s.size(); i++) {
			if (s[i] == c) {
				len = std::max(len, i - prev - 1);
				prev = i;
			}
		}
		if (prev != -1) {
			len = std::max<int>(len, s.size() - prev - 1);
			ans = std::min(ans, len);
		}
	}
	std::cout << ans << std::endl;
}

```