#include <bits/stdc++.h>
using namespace std;

char s[105];

int cur[30], mx[30];

int main() {
    scanf(" %s", s);
    for (int i = 0; s[i]; i++) {
        for (int j = 0; j <= 26; j++) {
            cur[j] = s[i]-'a' == j ? 0:cur[j]+1;
            mx[j] = max(mx[j],cur[j]);
        }
    }
    int ans = 1e9;
    for (int i = 0; i < 27; i++) ans = min(ans,mx[i]);
    printf("%d\n", ans);
}
### Prompt

Please provide a Cpp coded solution to the problem described below:

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 <bits/stdc++.h>
using namespace std;

char s[105];

int cur[30], mx[30];

int main() {
    scanf(" %s", s);
    for (int i = 0; s[i]; i++) {
        for (int j = 0; j <= 26; j++) {
            cur[j] = s[i]-'a' == j ? 0:cur[j]+1;
            mx[j] = max(mx[j],cur[j]);
        }
    }
    int ans = 1e9;
    for (int i = 0; i < 27; i++) ans = min(ans,mx[i]);
    printf("%d\n", ans);
}
```