#include <bits/stdc++.h>
using namespace std;
#define int long long int
string s;
int ans = 100000000;
void solve(string t,char c,int cnt){
	string new1;
	if(count(t.begin(),t.end(),t[0])==t.length()){
		ans = min(ans,cnt);
		return;
	}
	for(int i=0;i+1<t.length();i++){
		if(t[i]==c || t[i+1]==c){
			new1.push_back(c);
		}
		else {
			new1.push_back(t[i]);
		}
	}
	solve(new1,c,cnt+1);
}
int32_t main(){
	cin>>s;
	for(int i=0;i<s.length();i++){
		solve(s,s[i],0);
	}
	cout<<ans;
}

### Prompt

Please formulate 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 int long long int
string s;
int ans = 100000000;
void solve(string t,char c,int cnt){
	string new1;
	if(count(t.begin(),t.end(),t[0])==t.length()){
		ans = min(ans,cnt);
		return;
	}
	for(int i=0;i+1<t.length();i++){
		if(t[i]==c || t[i+1]==c){
			new1.push_back(c);
		}
		else {
			new1.push_back(t[i]);
		}
	}
	solve(new1,c,cnt+1);
}
int32_t main(){
	cin>>s;
	for(int i=0;i<s.length();i++){
		solve(s,s[i],0);
	}
	cout<<ans;
}

```