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

int main() {
	string S;
	cin >> S;
	int min = S.size(), max, c;
	for (int i = 'a';i <= 'z';i ++) {
		c = 0;
		max = 0;
		for (int j = 0;j < S.size();j ++) {
			if (S[j]-i) c ++;
			else c = 0;
			if (max < c) max = c;
		}
		if (min > max) min = max;
	}
	cout << min;
	return 0;
}
// ある文字における手数を求めたいとする。
// この時、これは指定文字間の文字数の最大値に等しい
// 例:whb r jpjyhs r ywlqjxdb r baomnw は3,6,8,6より、8手
// 後は26文字中最小になるものを探せばおｋ
### Prompt

In cpp, your task is to solve 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>
using namespace std;

int main() {
	string S;
	cin >> S;
	int min = S.size(), max, c;
	for (int i = 'a';i <= 'z';i ++) {
		c = 0;
		max = 0;
		for (int j = 0;j < S.size();j ++) {
			if (S[j]-i) c ++;
			else c = 0;
			if (max < c) max = c;
		}
		if (min > max) min = max;
	}
	cout << min;
	return 0;
}
// ある文字における手数を求めたいとする。
// この時、これは指定文字間の文字数の最大値に等しい
// 例:whb r jpjyhs r ywlqjxdb r baomnw は3,6,8,6より、8手
// 後は26文字中最小になるものを探せばおｋ
```