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

string s;

int search(char c){
    s[s.size()-1] = c;

    int ans = 0;
    int last = -1;
    for(int i = 0;i < s.size();i++){
        if(s[i] == c){
            ans = max(ans, i-(last+1));
            last = i;
        }
    }

    return ans;
}

int main(){
    cin >> s;
    s.push_back('*');

    int ans = INT_MAX;
    for(int i = 'a';i <= 'z';i++){
        ans = min(ans, search(i));
    }

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

string s;

int search(char c){
    s[s.size()-1] = c;

    int ans = 0;
    int last = -1;
    for(int i = 0;i < s.size();i++){
        if(s[i] == c){
            ans = max(ans, i-(last+1));
            last = i;
        }
    }

    return ans;
}

int main(){
    cin >> s;
    s.push_back('*');

    int ans = INT_MAX;
    for(int i = 'a';i <= 'z';i++){
        ans = min(ans, search(i));
    }

    cout << ans << endl;
    return 0;
}
```