#include <stdio.h>

char s[105];

int main(){
    scanf("%s", s);
    int n;
    for(n=0; s[n]; n++);
    int res = 1e9;
    for(char ch='a'; ch<='z'; ch++){
        int cons = 0, mx = 0;
        for(int i=0; i<n; i++){
            if(s[i] == ch){
                if(cons > mx) mx = cons;
                cons = 0;
            } else{
                cons++;
            }
        }
        if(cons > mx) mx = cons;
        if(mx < res) res = mx;
    }
    printf("%d", res);
    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 <stdio.h>

char s[105];

int main(){
    scanf("%s", s);
    int n;
    for(n=0; s[n]; n++);
    int res = 1e9;
    for(char ch='a'; ch<='z'; ch++){
        int cons = 0, mx = 0;
        for(int i=0; i<n; i++){
            if(s[i] == ch){
                if(cons > mx) mx = cons;
                cons = 0;
            } else{
                cons++;
            }
        }
        if(cons > mx) mx = cons;
        if(mx < res) res = mx;
    }
    printf("%d", res);
    return 0;
}
```