#include <iostream>
#include <string>
#include <algorithm>

int used[26];

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

	int ans = 10000000;
	for (char target = 'a'; target <= 'z'; ++target) {
		auto s = str;
		int res = 0;
		for (; std::count(s.begin(), s.end(), target) != s.size(); ++res) {
			for (int i = 0; i < s.size() - 1; ++i) {
				if (s[i + 1] == target)
					s[i] = target;
			}

			s.pop_back();
		}

		ans = std::min(ans, res);
	}
	
	std::cout << ans << std::endl;
}
### Prompt

Please formulate 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 <string>
#include <algorithm>

int used[26];

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

	int ans = 10000000;
	for (char target = 'a'; target <= 'z'; ++target) {
		auto s = str;
		int res = 0;
		for (; std::count(s.begin(), s.end(), target) != s.size(); ++res) {
			for (int i = 0; i < s.size() - 1; ++i) {
				if (s[i + 1] == target)
					s[i] = target;
			}

			s.pop_back();
		}

		ans = std::min(ans, res);
	}
	
	std::cout << ans << std::endl;
}
```