#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
  string s;
  cin >> s;
  ll ans = 10000;
  for (char c = 'a'; c <= 'z'; c++) {
    int tmp = 0;
    int l = 0;
    REP(i, s.size()) {
      if (s[i] == c) {
        tmp = max(i - l, tmp);
        l = i + 1;
      }
    }
    tmp = max((ll)s.size() - l, (ll)tmp);
    ans = min(ans, (ll)tmp);
  }
  cout << ans << endl;
}

### Prompt

Please create a solution in CPP 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 REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
  string s;
  cin >> s;
  ll ans = 10000;
  for (char c = 'a'; c <= 'z'; c++) {
    int tmp = 0;
    int l = 0;
    REP(i, s.size()) {
      if (s[i] == c) {
        tmp = max(i - l, tmp);
        l = i + 1;
      }
    }
    tmp = max((ll)s.size() - l, (ll)tmp);
    ans = min(ans, (ll)tmp);
  }
  cout << ans << endl;
}

```