#include <bits/stdc++.h>
using namespace std;
#define ALL(A) (A).begin(),(A).end()

int cnt[26];

int main(void){
	string s,t;
	int ans = 150;
	cin >> s;
	for(char i='a';i<='z';i++){
		t = s;
		int cur = 0;
		while(true){
			set<char> st;
			for(char i:t)st.insert(i);
			if(st.size()==1){
				break;
			}
			cur++;
			for(int j=0;j<t.size()-1;j++){
				if(t[j+1] == i){
					t[j] = i;
				}
			}
			t.pop_back();
		}
		ans = min(ans,cur);
	}
	cout << ans << endl;
}
### Prompt

Generate 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 <bits/stdc++.h>
using namespace std;
#define ALL(A) (A).begin(),(A).end()

int cnt[26];

int main(void){
	string s,t;
	int ans = 150;
	cin >> s;
	for(char i='a';i<='z';i++){
		t = s;
		int cur = 0;
		while(true){
			set<char> st;
			for(char i:t)st.insert(i);
			if(st.size()==1){
				break;
			}
			cur++;
			for(int j=0;j<t.size()-1;j++){
				if(t[j+1] == i){
					t[j] = i;
				}
			}
			t.pop_back();
		}
		ans = min(ans,cur);
	}
	cout << ans << endl;
}
```