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

int N;
string S;

int get(int x){
    int sum = 0, cnt = 0;
    for(int i = 0; i < N; i++){
        cnt++;
        if(S[i] == x) cnt = 0;
        sum = max(sum, cnt);
    }
    return sum;
    }




int main(){
    cin >> S;
    int ans = 1000;
    N = S.size();
    int crt;
    for(int i = 'a'; i <='z'; i++){
        crt = get(i);
        ans = min(ans, crt);
    }
    cout << ans << endl;
}
### Prompt

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

int N;
string S;

int get(int x){
    int sum = 0, cnt = 0;
    for(int i = 0; i < N; i++){
        cnt++;
        if(S[i] == x) cnt = 0;
        sum = max(sum, cnt);
    }
    return sum;
    }




int main(){
    cin >> S;
    int ans = 1000;
    N = S.size();
    int crt;
    for(int i = 'a'; i <='z'; i++){
        crt = get(i);
        ans = min(ans, crt);
    }
    cout << ans << endl;
}
```