#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
	
using namespace std;

string s;

int main(){
	cin>>s;
	int ans=(int)s.size();
	REP(i,(int)s.size()){
		char c=s[i];
		int cnt=0,temp=0;
		REP(j,(int)s.size()){
			if (s[s.size()-j-1]!=c){
				cnt++;
			}else{
				cnt=0;
			}
			temp=max(temp,cnt);
		}
		ans=min(ans,temp);
	}
	cout<<ans<<endl;
	return 0;
}
### Prompt

Please provide a cpp coded solution 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 <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
	
using namespace std;

string s;

int main(){
	cin>>s;
	int ans=(int)s.size();
	REP(i,(int)s.size()){
		char c=s[i];
		int cnt=0,temp=0;
		REP(j,(int)s.size()){
			if (s[s.size()-j-1]!=c){
				cnt++;
			}else{
				cnt=0;
			}
			temp=max(temp,cnt);
		}
		ans=min(ans,temp);
	}
	cout<<ans<<endl;
	return 0;
}
```