#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	string s;cin >> s;
	int n=s.size();
	int ans=100000,cnt=0;
	rep(i,n){
		int cur=0;
		rep(j,n){
			if(s.at(i)==s.at(j)){
				cur=max(cur,cnt);
				cnt=0;
			}
			else cnt++;
		}
		cur=max(cur,cnt);
		cnt=0;
		ans=min(ans,cur);
	}
	cout << ans << endl;
}
### Prompt

Construct a cpp code solution to the problem outlined:

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;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	string s;cin >> s;
	int n=s.size();
	int ans=100000,cnt=0;
	rep(i,n){
		int cur=0;
		rep(j,n){
			if(s.at(i)==s.at(j)){
				cur=max(cur,cnt);
				cnt=0;
			}
			else cnt++;
		}
		cur=max(cur,cnt);
		cnt=0;
		ans=min(ans,cur);
	}
	cout << ans << endl;
}
```