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

string s;

int main() {
  cin >> s; int l = s.size();
  int res = 1000000;
  for(char c = 'a'; c <= 'z'; ++c) {
    int n = 0; int k = l;
    for(int i = l - 1; i >= 0; --i) {
      if(s[i] == c) k = i;
      n = max(n, k - i);
    }
    res = min(res, n);
  }
  printf("%d\n", res);
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

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;

string s;

int main() {
  cin >> s; int l = s.size();
  int res = 1000000;
  for(char c = 'a'; c <= 'z'; ++c) {
    int n = 0; int k = l;
    for(int i = l - 1; i >= 0; --i) {
      if(s[i] == c) k = i;
      n = max(n, k - i);
    }
    res = min(res, n);
  }
  printf("%d\n", res);
  return 0;
}

```