#include <iostream>
#include <algorithm>

using namespace std;

//ifstream cin ("test.in");
//ofstream cout ("test.out");

string s;
int ans = 0x3f3f3f3f;
int lng[26];

int main() {
  cin >> s;
  for (int i = 0; i < 26; ++i) {
    int cnt = 0;
    for (char it: s) {
      if (it == i + 'a') {
        cnt = 0;
      }
      else {
        ++cnt;
      }

      lng[i] = max(lng[i], cnt);
    }

    ans = min(lng[i], ans);
  }

  cout << ans << '\n';
  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>
#include <algorithm>

using namespace std;

//ifstream cin ("test.in");
//ofstream cout ("test.out");

string s;
int ans = 0x3f3f3f3f;
int lng[26];

int main() {
  cin >> s;
  for (int i = 0; i < 26; ++i) {
    int cnt = 0;
    for (char it: s) {
      if (it == i + 'a') {
        cnt = 0;
      }
      else {
        ++cnt;
      }

      lng[i] = max(lng[i], cnt);
    }

    ans = min(lng[i], ans);
  }

  cout << ans << '\n';
  return 0;
}
```