#include <iostream>

using namespace std;
int A[300];

int rec(char c , string s){
    bool ok =1 ;
    for(auto a : s) if(c!=a)ok =0;
    if(ok ) return 0 ;
    string ss;
    for(int i = 0 ; i< s.size()-1 ; i++){
        if(s[i]==c ||s[i+1]==c)ss+=c;
        else ss+=s[i];
    }
    return 1 + rec(c,ss);
}

int main()
{
    string s ;
    cin >> s ;
    int m = 100 ;
    for(char c = 'a' ; c<='z' ; c++){
        m = min ( m , rec(c,s));
    }
    cout<<m ;
    return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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 <iostream>

using namespace std;
int A[300];

int rec(char c , string s){
    bool ok =1 ;
    for(auto a : s) if(c!=a)ok =0;
    if(ok ) return 0 ;
    string ss;
    for(int i = 0 ; i< s.size()-1 ; i++){
        if(s[i]==c ||s[i+1]==c)ss+=c;
        else ss+=s[i];
    }
    return 1 + rec(c,ss);
}

int main()
{
    string s ;
    cin >> s ;
    int m = 100 ;
    for(char c = 'a' ; c<='z' ; c++){
        m = min ( m , rec(c,s));
    }
    cout<<m ;
    return 0;
}

```