#include <iostream>
using namespace std;

#define MAX(X,Y) ((X)>(Y)?(X):(Y))
#define MIN(X,Y) ((X)<(Y)?(X):(Y))

int main(void){
  int ans;
  string s;
  
  cin >> s;
  ans = s.length();
  for (char c='a'; c<='z'; c++){
    int left, len;
    left = -1; len = 0;
    for (int i=0; i<s.length(); i++){
      if (s[i]==c){
        len = MAX(len,i-left-1);
        left = i;
      }
    }
    len = MAX(len,s.length()-left-1);
    ans = MIN(ans, len);
  }
  cout << ans << endl;
  return 0;
}

### Prompt

Generate 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 <iostream>
using namespace std;

#define MAX(X,Y) ((X)>(Y)?(X):(Y))
#define MIN(X,Y) ((X)<(Y)?(X):(Y))

int main(void){
  int ans;
  string s;
  
  cin >> s;
  ans = s.length();
  for (char c='a'; c<='z'; c++){
    int left, len;
    left = -1; len = 0;
    for (int i=0; i<s.length(); i++){
      if (s[i]==c){
        len = MAX(len,i-left-1);
        left = i;
      }
    }
    len = MAX(len,s.length()-left-1);
    ans = MIN(ans, len);
  }
  cout << ans << endl;
  return 0;
}

```