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

typedef long long lint;
typedef pair<int, int> pii;

const int INF = 2e9;
const int MOD = 1e9+7;
const int MAX = 1e5+10;
const lint LNF = 2e18;

int n, ans=INF;
char S[110];

int main(){
	ios::sync_with_stdio(0); cin.tie(0);

	cin>>S;
	n = strlen(S);
	for(char c='a'; c<='z'; c++){
		int now=0, mx=0;
		for(int i=0; i<n; i++){
			if(S[i]==c) now=0;
			else now++;
			mx = max(now, mx);
		}
		ans = min(ans, mx);
	}
	cout<<ans<<'\n';

	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>
using namespace std;

typedef long long lint;
typedef pair<int, int> pii;

const int INF = 2e9;
const int MOD = 1e9+7;
const int MAX = 1e5+10;
const lint LNF = 2e18;

int n, ans=INF;
char S[110];

int main(){
	ios::sync_with_stdio(0); cin.tie(0);

	cin>>S;
	n = strlen(S);
	for(char c='a'; c<='z'; c++){
		int now=0, mx=0;
		for(int i=0; i<n; i++){
			if(S[i]==c) now=0;
			else now++;
			mx = max(now, mx);
		}
		ans = min(ans, mx);
	}
	cout<<ans<<'\n';

	return 0;
}
```