#include<bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;

const int mnx = 3e5 + 9;
const int mod = 1e9 + 7;

string s;
int ans = 100;
int now, mx;

int main(){

cin>>s;

for(int i=97; i<=122; i++){
    now = 0;
    mx = 0;
    for(char c : s){
        if(c == i){
            now = 0;
        } else {
            mx = max(mx, ++now);
        }
    }
    ans = min(ans, mx);
}

cout<<ans<<'\n';

return 0;

}














### Prompt

Construct a CPP code solution to the problem outlined:

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>
#define ll long long
#define pb push_back
using namespace std;

const int mnx = 3e5 + 9;
const int mod = 1e9 + 7;

string s;
int ans = 100;
int now, mx;

int main(){

cin>>s;

for(int i=97; i<=122; i++){
    now = 0;
    mx = 0;
    for(char c : s){
        if(c == i){
            now = 0;
        } else {
            mx = max(mx, ++now);
        }
    }
    ans = min(ans, mx);
}

cout<<ans<<'\n';

return 0;

}














```