#include <bits/stdc++.h>
using namespace std;
string S;
int N;

int t(int to) {
    int ret = 0;
    int cur = 0;
    for(int i=N-1;i>=0;i--) {
        if((int)S[i] == to) {
            cur = 0;
        } else {
            cur++;
        }
        ret = max(ret, cur);
    }
    return ret;
}

int main() {
    cin >> S;
    N = S.size();
    int ans = 1e9;
    for(int i='a';i<='z'; i++) {
        ans = min(ans, t(i)); 
    } 
    printf("%d\n", ans);
}
### Prompt

In Cpp, your task is to solve 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 <bits/stdc++.h>
using namespace std;
string S;
int N;

int t(int to) {
    int ret = 0;
    int cur = 0;
    for(int i=N-1;i>=0;i--) {
        if((int)S[i] == to) {
            cur = 0;
        } else {
            cur++;
        }
        ret = max(ret, cur);
    }
    return ret;
}

int main() {
    cin >> S;
    N = S.size();
    int ans = 1e9;
    for(int i='a';i<='z'; i++) {
        ans = min(ans, t(i)); 
    } 
    printf("%d\n", ans);
}
```