#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

char sir[110];

int main()
{
    //freopen("file.in","r",stdin);
    //freopen("file.out","w",stdout);
    scanf("%s",sir+1);
    int l=strlen(sir+1),sol=1e9;
    for(char i='a';i<='z';i++)
    {
        sir[l+1]=i;
        int c=0,r=0;
        for(int j=1;j<=l+1;j++)
            if(sir[j]==i) {r=max(r,c);c=0;}
            else c++;
        sol=min(sol,r);
    }
    printf("%d",sol);
    return 0;
}

### Prompt

Your task is to create 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 <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

char sir[110];

int main()
{
    //freopen("file.in","r",stdin);
    //freopen("file.out","w",stdout);
    scanf("%s",sir+1);
    int l=strlen(sir+1),sol=1e9;
    for(char i='a';i<='z';i++)
    {
        sir[l+1]=i;
        int c=0,r=0;
        for(int j=1;j<=l+1;j++)
            if(sir[j]==i) {r=max(r,c);c=0;}
            else c++;
        sol=min(sol,r);
    }
    printf("%d",sol);
    return 0;
}

```