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

bool check(string a){
  char ch = a[0];
  for(int i=0;i<(int)a.size();i++)if(a[i]!=ch) return 0;
  return 1; 
}

int dfs(string s,char ch){
  if(check(s)) return 0;
  
  string ns;
  for(int i=0;i<(int)s.size()-1;i++){
    if(s[i+1] == ch) ns+=ch;
    else ns += s[i];
  }
  return 1+dfs(ns,ch);
}

int main(){
  string str;
  cin>>str;

  int ans = 1e9;
  for(int i='a';i<='z';i++)ans=min(ans,dfs(str,i));
  cout<<ans<<endl;


  return 0;
}

### Prompt

Please provide a CPP coded solution 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;

bool check(string a){
  char ch = a[0];
  for(int i=0;i<(int)a.size();i++)if(a[i]!=ch) return 0;
  return 1; 
}

int dfs(string s,char ch){
  if(check(s)) return 0;
  
  string ns;
  for(int i=0;i<(int)s.size()-1;i++){
    if(s[i+1] == ch) ns+=ch;
    else ns += s[i];
  }
  return 1+dfs(ns,ch);
}

int main(){
  string str;
  cin>>str;

  int ans = 1e9;
  for(int i='a';i<='z';i++)ans=min(ans,dfs(str,i));
  cout<<ans<<endl;


  return 0;
}

```