#include <iostream>

using namespace std;

int main(){
	string s; cin>>s;
	int a = 1e9;
	for(char c='a'; c<='z'; c++){
		int lo = -1;
		int mr = 0;
		for(int x=0; x<s.length(); x++){
			mr = max(mr, (int)x-lo-1);
			if(s[x]==c)
				lo = x;

		}
//		cout << lo << endl;
		mr = max(mr, (int)s.length()-lo-1);
		a = min(a, mr);
	}
	cout << a << 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 <iostream>

using namespace std;

int main(){
	string s; cin>>s;
	int a = 1e9;
	for(char c='a'; c<='z'; c++){
		int lo = -1;
		int mr = 0;
		for(int x=0; x<s.length(); x++){
			mr = max(mr, (int)x-lo-1);
			if(s[x]==c)
				lo = x;

		}
//		cout << lo << endl;
		mr = max(mr, (int)s.length()-lo-1);
		a = min(a, mr);
	}
	cout << a << endl;
	return 0;
}
```