#include <bits/stdc++.h>
#define INF (1<<30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;

int main(){
	string s; cin >> s;
	int ans = INF;
	for( char trg = 'a'; trg <= 'z'; ++trg ){
		string t = s;
		int cntmax = 0;
		int cnt = 0;
		for( auto c : t ){
			if( c != trg ){
				++cnt;
				cntmax = max(cnt, cntmax);
			} else {
				cnt = 0;
			}
		}
		ans = min(cntmax, ans);
	}
	cout << ans << endl;
	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>
#define INF (1<<30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;

int main(){
	string s; cin >> s;
	int ans = INF;
	for( char trg = 'a'; trg <= 'z'; ++trg ){
		string t = s;
		int cntmax = 0;
		int cnt = 0;
		for( auto c : t ){
			if( c != trg ){
				++cnt;
				cntmax = max(cnt, cntmax);
			} else {
				cnt = 0;
			}
		}
		ans = min(cntmax, ans);
	}
	cout << ans << endl;
	return 0;
}
```