#include <bits/stdc++.h>
using namespace std;
using ll = long long;

string s;

void solve()
{
	const int n = s.length();
	int ans = n-1;
	set<char> ch(s.begin(), s.end());
	for(char c : ch){
		int p=-1;
		int cur = 0;
		for(int i=0;i<n;++i)if(s[i]==c){
			cur=max(cur, i-p-1);
			p = i;
		}
		cur=max(cur, n-p-1);
		ans=min(ans, cur);
	}
	cout<<ans<<'\n';
}

int main()
{
	cin >> s;
	solve();
	return 0;
}
### Prompt

Develop a solution in CPP 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>
using namespace std;
using ll = long long;

string s;

void solve()
{
	const int n = s.length();
	int ans = n-1;
	set<char> ch(s.begin(), s.end());
	for(char c : ch){
		int p=-1;
		int cur = 0;
		for(int i=0;i<n;++i)if(s[i]==c){
			cur=max(cur, i-p-1);
			p = i;
		}
		cur=max(cur, n-p-1);
		ans=min(ans, cur);
	}
	cout<<ans<<'\n';
}

int main()
{
	cin >> s;
	solve();
	return 0;
}
```