#include <cstdio>
#include <algorithm>
char s[101];
int a[100], N, O = 101;
int check()
{
	int L = N;
	while (std::count(a, a + L, 1) != L)
	{
		for (int i = 0; i < L - 1; i++)
			a[i] |= a[i + 1];
		L--;
	}
	return N - L;
}
int main()
{
	scanf("%s", s);
	while (s[N])
		N++;
	for (char i = 'a'; i <= 'z'; i++)
	{
		for (int j = 0; j < N; j++)
			a[j] = s[j] == i;
		O = std::min(O, check());
	}
	printf("%d\n", O);
	return 0;
}

### Prompt

Please formulate a cpp solution to the following problem:

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 <cstdio>
#include <algorithm>
char s[101];
int a[100], N, O = 101;
int check()
{
	int L = N;
	while (std::count(a, a + L, 1) != L)
	{
		for (int i = 0; i < L - 1; i++)
			a[i] |= a[i + 1];
		L--;
	}
	return N - L;
}
int main()
{
	scanf("%s", s);
	while (s[N])
		N++;
	for (char i = 'a'; i <= 'z'; i++)
	{
		for (int j = 0; j < N; j++)
			a[j] = s[j] == i;
		O = std::min(O, check());
	}
	printf("%d\n", O);
	return 0;
}

```