#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>

using namespace std;
int sub(const string& s, char c) {
  stringstream ss(c + s + c);
  int mx = 0;
  string buf;
  while(getline(ss, buf, c)) {
    mx = max(mx, (int)buf.size());
  }
  return mx;
}


int main() {
  string s;
  cin >> s;
  
  int mn = 1e9;
  for(char c = 'a'; c <= 'z'; ++c) {
    mn = min(mn, sub(s, c));
  }
  cout << mn << endl;
  return 0;
}

### Prompt

Your challenge is to write 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>
#include <sstream>
#include <string>
#include <algorithm>

using namespace std;
int sub(const string& s, char c) {
  stringstream ss(c + s + c);
  int mx = 0;
  string buf;
  while(getline(ss, buf, c)) {
    mx = max(mx, (int)buf.size());
  }
  return mx;
}


int main() {
  string s;
  cin >> s;
  
  int mn = 1e9;
  for(char c = 'a'; c <= 'z'; ++c) {
    mn = min(mn, sub(s, c));
  }
  cout << mn << endl;
  return 0;
}

```