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

using namespace std;

char a[110];

int main()
{
	scanf("%s",a+1);int n=strlen(a+1);
	int ans=n;
	for (int c='a';c<='z';c++)
	{
		int x=0,t=0;
		for (int i=1;i<=n+1;i++)
		{
			t=max(t,i-x);
			if (i<=n&&a[i]==c) x=i;
		}
		ans=min(ans,t);
	}
	printf("%d\n",ans-1);
	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 <cstring>
#include <algorithm>

using namespace std;

char a[110];

int main()
{
	scanf("%s",a+1);int n=strlen(a+1);
	int ans=n;
	for (int c='a';c<='z';c++)
	{
		int x=0,t=0;
		for (int i=1;i<=n+1;i++)
		{
			t=max(t,i-x);
			if (i<=n&&a[i]==c) x=i;
		}
		ans=min(ans,t);
	}
	printf("%d\n",ans-1);
	return 0;
}

```