#include <iostream>
#include <string>

using namespace std;

string s;

int main(void)
{
	cin >> s;
	
	int ans = s.size();
	for(char c = 'a'; c <= 'z'; c++){
		string t = s;
		for(int i = 0; i < s.size(); i++){
			bool flag = true;
			for(int j = 0; j < t.size(); j++) flag &= (t[j] == c);
			if(flag){
				ans = min(ans, i);
				break;
			}
			for(int j = 0; j < t.size()-1; j++){
				if(t[j] == c || t[j+1] == c) t[j] = c;
			}
			t.erase(t.end()-1);
			
		}
	}
	cout << ans << endl;
}
### Prompt

Develop a solution in cpp to the problem described below:

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;

string s;

int main(void)
{
	cin >> s;
	
	int ans = s.size();
	for(char c = 'a'; c <= 'z'; c++){
		string t = s;
		for(int i = 0; i < s.size(); i++){
			bool flag = true;
			for(int j = 0; j < t.size(); j++) flag &= (t[j] == c);
			if(flag){
				ans = min(ans, i);
				break;
			}
			for(int j = 0; j < t.size()-1; j++){
				if(t[j] == c || t[j+1] == c) t[j] = c;
			}
			t.erase(t.end()-1);
			
		}
	}
	cout << ans << endl;
}
```