#include <iostream>

using namespace std;

int i,j,n;
string str;

int main(){
  long long ans = 100;
  cin >> str;
  for(int i = 0;i < 26;i++){
    char c = 'a'+i;
    int maxi = 0,count = 0;
    for(int j = 0;j < str.length();j++){
      if(str[j] == c){
        if(count > maxi) maxi = count;
        count = 0;
      }
      else{
        count++;
      }
    }
    if(count > maxi) maxi = count;
    if(maxi < ans) ans = maxi;
  }
  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 <iostream>

using namespace std;

int i,j,n;
string str;

int main(){
  long long ans = 100;
  cin >> str;
  for(int i = 0;i < 26;i++){
    char c = 'a'+i;
    int maxi = 0,count = 0;
    for(int j = 0;j < str.length();j++){
      if(str[j] == c){
        if(count > maxi) maxi = count;
        count = 0;
      }
      else{
        count++;
      }
    }
    if(count > maxi) maxi = count;
    if(maxi < ans) ans = maxi;
  }
  cout << ans << endl;
}

```