#include <iostream>
#include <cstdio>
using namespace std;

string a;
int n, mx, mn = 2e9, cnt;
bool v[105];
int main()
{
	int i, j;
	cin >> a;
	for (i =0; i < a.size(); i++) {
		if (v[i]) continue;
		v[i] = 1;
		mx = i;
		cnt = 0;
		for (j = i + 1; j < a.size(); j++) {
			cnt++;
			if (a[j] == a[i]) {
				mx = max(mx, cnt - 1);
				cnt = 0;
			}
		}
		mx = max(mx, cnt);
		mn = min(mn, mx);
	}
    cout << mn;
    return 0;
}

### 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 <iostream>
#include <cstdio>
using namespace std;

string a;
int n, mx, mn = 2e9, cnt;
bool v[105];
int main()
{
	int i, j;
	cin >> a;
	for (i =0; i < a.size(); i++) {
		if (v[i]) continue;
		v[i] = 1;
		mx = i;
		cnt = 0;
		for (j = i + 1; j < a.size(); j++) {
			cnt++;
			if (a[j] == a[i]) {
				mx = max(mx, cnt - 1);
				cnt = 0;
			}
		}
		mx = max(mx, cnt);
		mn = min(mn, mx);
	}
    cout << mn;
    return 0;
}

```