#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
int n;

int main(){

cin>>s;
n=s.length();

int ans=1<<30;
for(char c='a';c<='z';c++){
int mx=-1;
    for(int i=0;i<n;i++){
        bool f=1;
        for(int j=i;j<n;j++)
        if( s[j]==c ){
            f=0;
            mx=max( mx,j-i );
            break;
        }
        if( f )
            mx=max(mx,n-i);
        }
ans=min(ans,mx);
}
ans=min( ans , n-ans );
cout<<ans<<endl;
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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
int n;

int main(){

cin>>s;
n=s.length();

int ans=1<<30;
for(char c='a';c<='z';c++){
int mx=-1;
    for(int i=0;i<n;i++){
        bool f=1;
        for(int j=i;j<n;j++)
        if( s[j]==c ){
            f=0;
            mx=max( mx,j-i );
            break;
        }
        if( f )
            mx=max(mx,n-i);
        }
ans=min(ans,mx);
}
ans=min( ans , n-ans );
cout<<ans<<endl;
return 0;
}

```