#include <cstdio>
#include <algorithm>
#include <cstring>

int n;
char s[111];

int main(void)
{
	char x;
	int i,j;
	int t,w;
	int answer = 1000000000;

	//freopen("x.in","r",stdin);

	scanf("%s",s);
	n = strlen(s);
	for(x = 'a';x <= 'z';++x)
	{
		w = -1;
		t = 0;
		for(i = n - 1;i >= 0;--i)
			if(s[i] == x)
				w = std::max(w,t),t = 0;
			else
				++t;
		w = std::max(w,t);
		answer = std::min(answer,w);
	}
	printf("%d\n",answer);

	return 0;
}
### Prompt

Create a solution in CPP for 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>
#include <cstring>

int n;
char s[111];

int main(void)
{
	char x;
	int i,j;
	int t,w;
	int answer = 1000000000;

	//freopen("x.in","r",stdin);

	scanf("%s",s);
	n = strlen(s);
	for(x = 'a';x <= 'z';++x)
	{
		w = -1;
		t = 0;
		for(i = n - 1;i >= 0;--i)
			if(s[i] == x)
				w = std::max(w,t),t = 0;
			else
				++t;
		w = std::max(w,t);
		answer = std::min(answer,w);
	}
	printf("%d\n",answer);

	return 0;
}
```