#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char s[105], t[105], c;
int mn=99;

int f(char p[], char q) {
	int i, n=strlen(p);
	for(i=0; i<n; i++) if(p[i] != p[0]) break;
	if(i==n) return 0;
	for(i=0; i<n; i++) if(p[i+1]==q) p[i]=q;
	p[n-1] = '\0';
	return f(p, q) + 1;
}

int main() {
	cin>>s;
	for(c='a'; c<='z'; c++) {
		strcpy(t, s);
		mn = min(mn, f(t, c));
	}
	cout<<mn;
	return 0;
}
### Prompt

Please create a solution in Cpp 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 <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char s[105], t[105], c;
int mn=99;

int f(char p[], char q) {
	int i, n=strlen(p);
	for(i=0; i<n; i++) if(p[i] != p[0]) break;
	if(i==n) return 0;
	for(i=0; i<n; i++) if(p[i+1]==q) p[i]=q;
	p[n-1] = '\0';
	return f(p, q) + 1;
}

int main() {
	cin>>s;
	for(c='a'; c<='z'; c++) {
		strcpy(t, s);
		mn = min(mn, f(t, c));
	}
	cout<<mn;
	return 0;
}
```