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

#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))

typedef long long LL;

int main(){
  string s;
  cin >> s;
  int count=0,tmp=0,ans=100;
  for(int i=0;i<26;i++){
    count=tmp=0;
    for(int j=0;j<s.length();j++){
      if(s[j]=='a'+i){
        tmp=max(tmp,count);
        count=0;
      }else{
        count++;
      }
    }
    tmp=max(tmp,count);
    ans=min(ans,tmp);
  }
  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;

#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))

typedef long long LL;

int main(){
  string s;
  cin >> s;
  int count=0,tmp=0,ans=100;
  for(int i=0;i<26;i++){
    count=tmp=0;
    for(int j=0;j<s.length();j++){
      if(s[j]=='a'+i){
        tmp=max(tmp,count);
        count=0;
      }else{
        count++;
      }
    }
    tmp=max(tmp,count);
    ans=min(ans,tmp);
  }
  cout << ans << endl;
  return 0;
}

```