#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007

ll now[26],ans[26];
int main() {
	string s;
	cin>>s;
	for(ll i=0;i<26;i++){
		now[i]=-1;
	}
	for(ll i=0;i<s.size();i++){
		ll no=s[i]-'a';
		ans[no]=max(ans[no],i-now[no]-1);
		now[no]=i;
	}
	ll ans2=inf;
	for(ll i=0;i<26;i++){
		ll no=s.size()-1-now[i];
		ans[i]=max(ans[i],no);
		ans2=min(ans2,ans[i]);
	}
	cout <<ans2;
	// your code goes here
	return 0;
}
### 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007

ll now[26],ans[26];
int main() {
	string s;
	cin>>s;
	for(ll i=0;i<26;i++){
		now[i]=-1;
	}
	for(ll i=0;i<s.size();i++){
		ll no=s[i]-'a';
		ans[no]=max(ans[no],i-now[no]-1);
		now[no]=i;
	}
	ll ans2=inf;
	for(ll i=0;i<26;i++){
		ll no=s.size()-1-now[i];
		ans[i]=max(ans[i],no);
		ans2=min(ans2,ans[i]);
	}
	cout <<ans2;
	// your code goes here
	return 0;
}
```