#include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

int calc(string s,int c){
	int n=s.length();
	if(count(s.begin(),s.end(),c)==n) return 0;

	string t;
	rep(i,n-1) t+=(s[i]==c?s[i]:s[i+1]);
	return calc(t,c)+1;
}

int main(){
	string s; cin>>s;

	int ans=100;
	for(char c='a';c<='z';c++) ans=min(ans,calc(s,c));
	cout<<ans<<'\n';

	return 0;
}

### 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>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

int calc(string s,int c){
	int n=s.length();
	if(count(s.begin(),s.end(),c)==n) return 0;

	string t;
	rep(i,n-1) t+=(s[i]==c?s[i]:s[i+1]);
	return calc(t,c)+1;
}

int main(){
	string s; cin>>s;

	int ans=100;
	for(char c='a';c<='z';c++) ans=min(ans,calc(s,c));
	cout<<ans<<'\n';

	return 0;
}

```