#include<iostream>
#include<algorithm>
#include<string>
std::string S;
int ans = 1 << 30;
int main() {
	std::cin >> S;
	for (int i = 0; i < 26; i++) {
		char ser = 'a' + i;
		int sum = 0;
		int max = 0;
		for (auto u : S) {
			if (u == ser)max = std::max(sum, max), sum = -1;
			sum++;
		}
		max = std::max(sum, max);
		ans = std::min(ans, max);
	}
	std::cout << ans << std::endl;
	return 0;
}
### Prompt

Construct a Cpp code solution to the problem outlined:

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<algorithm>
#include<string>
std::string S;
int ans = 1 << 30;
int main() {
	std::cin >> S;
	for (int i = 0; i < 26; i++) {
		char ser = 'a' + i;
		int sum = 0;
		int max = 0;
		for (auto u : S) {
			if (u == ser)max = std::max(sum, max), sum = -1;
			sum++;
		}
		max = std::max(sum, max);
		ans = std::min(ans, max);
	}
	std::cout << ans << std::endl;
	return 0;
}
```