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

int main() {
  string s; cin >> s;
  int n = s.length();
  int ans = n-1;
  for (char c = 'a'; c <= 'z'; c++) {
    	int res = 0;
  		for (int i = 0; i < n; i++) {
        	int j = i;
          	while (j<n && s[j] != c) j++;
          	res = max(res,j-i);
        }
    	ans = min(ans,res);
  }
  cout << ans << endl;
  return 0; 
}
### Prompt

Construct a Cpp code solution to the problem outlined:

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;

int main() {
  string s; cin >> s;
  int n = s.length();
  int ans = n-1;
  for (char c = 'a'; c <= 'z'; c++) {
    	int res = 0;
  		for (int i = 0; i < n; i++) {
        	int j = i;
          	while (j<n && s[j] != c) j++;
          	res = max(res,j-i);
        }
    	ans = min(ans,res);
  }
  cout << ans << endl;
  return 0; 
}
```