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

int main(){
  string S;
  cin >> S;

  int min_ = 101;
  for(int i = S.size() - 1; i >= 0; i--){
    char x = S.at(i);
    int max_ = S.size() - i - 1;
    
    if(max_ > min_)
      break;

    int c = 0;
    for(int j = i - 1; j >= 0; j--){
      if(S.at(j) != x){
        c++;
      }
      else{
        max_ = max(max_, c);
        c = 0;
      }
    }
    max_ = max(max_,c);

    min_ = min(min_,max_);
  }

  cout << min_ << endl;
}

### Prompt

Construct a CPP code solution to the problem outlined:

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;

int main(){
  string S;
  cin >> S;

  int min_ = 101;
  for(int i = S.size() - 1; i >= 0; i--){
    char x = S.at(i);
    int max_ = S.size() - i - 1;
    
    if(max_ > min_)
      break;

    int c = 0;
    for(int j = i - 1; j >= 0; j--){
      if(S.at(j) != x){
        c++;
      }
      else{
        max_ = max(max_, c);
        c = 0;
      }
    }
    max_ = max(max_,c);

    min_ = min(min_,max_);
  }

  cout << min_ << endl;
}

```