#include<cstdio>
#include<cstring>
#define f(i,a,b) for(register int i=(a);i<=(b);i=-(~i))
char s[1010];
int realans=1e9,len,last[110],ans[110];
int cmin(int a,int b){return a<b?a:b;}
int cmax(int a,int b){return a>b?a:b;}
int main()
{
	scanf("%s",s+1),len=strlen(s+1);
	f(i,1,len)
	{
		ans[s[i]-'a']=cmax(ans[s[i]-'a'],i-last[s[i]-'a']-1);
		last[s[i]-'a']=i;
	}
	f(i,0,25)if(last[i])realans=cmin(ans[i]=cmax(ans[i],len-last[i]),realans);
	return printf("%d\n",realans),0;
}
### Prompt

Your challenge is to write 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>
#define f(i,a,b) for(register int i=(a);i<=(b);i=-(~i))
char s[1010];
int realans=1e9,len,last[110],ans[110];
int cmin(int a,int b){return a<b?a:b;}
int cmax(int a,int b){return a>b?a:b;}
int main()
{
	scanf("%s",s+1),len=strlen(s+1);
	f(i,1,len)
	{
		ans[s[i]-'a']=cmax(ans[s[i]-'a'],i-last[s[i]-'a']-1);
		last[s[i]-'a']=i;
	}
	f(i,0,25)if(last[i])realans=cmin(ans[i]=cmax(ans[i],len-last[i]),realans);
	return printf("%d\n",realans),0;
}
```