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

long long int N, a[26], m[26], i, c;
char s[114];

int main(){
    scanf("%s", s);
    N = strlen(s);
    fill(a, a + 26, -1);
    for(int i = 0; i < N; ++i){
        c = s[i] - 97;
        m[c] = max(m[c], i - a[c] - 1);
        a[c] = i;
    }
    for(int i = 0; i < 26; ++i){
        m[i] = max(m[i], N - a[i] - 1);
    }
    cout << *min_element(m, m + 26) << endl;
    return 0;
}

### 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;

long long int N, a[26], m[26], i, c;
char s[114];

int main(){
    scanf("%s", s);
    N = strlen(s);
    fill(a, a + 26, -1);
    for(int i = 0; i < N; ++i){
        c = s[i] - 97;
        m[c] = max(m[c], i - a[c] - 1);
        a[c] = i;
    }
    for(int i = 0; i < 26; ++i){
        m[i] = max(m[i], N - a[i] - 1);
    }
    cout << *min_element(m, m + 26) << endl;
    return 0;
}

```