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

int mn = 1e9;
string s, t;

bool f(int p, int q) {
	int i;
	for (i = 0; i < q; i++) if (t[i] != p) return 1;
	return 0;
}

int main()
{
	int i, j, k;
	cin >> s;
	for (i = 'a'; i <= 'z'; i++) {
		t = s;
		for (j = 0; f(i, s.size() - j); j++) {
			for (k = 0; k < s.size() - j - 1; k++) {
				if (t[k] == i || t[k + 1] == i)
					t[k] = i;
			}
		}
		mn = min(mn, j);
	}
    cout << mn << 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 <iostream>
#include <cstdio>
using namespace std;

int mn = 1e9;
string s, t;

bool f(int p, int q) {
	int i;
	for (i = 0; i < q; i++) if (t[i] != p) return 1;
	return 0;
}

int main()
{
	int i, j, k;
	cin >> s;
	for (i = 'a'; i <= 'z'; i++) {
		t = s;
		for (j = 0; f(i, s.size() - j); j++) {
			for (k = 0; k < s.size() - j - 1; k++) {
				if (t[k] == i || t[k + 1] == i)
					t[k] = i;
			}
		}
		mn = min(mn, j);
	}
    cout << mn << endl;
    return 0;
}
```