#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;

int main()
{
	ios::sync_with_stdio(false);

	string s;
	cin >> s;
	int n = s.size();
	int res = n;
	for (int x=0; x<26; x++)
	{
		int ans = 0, cnt = 0;
		for (int i=0; i<n; i++)
		{
			if (x != s[i] - 'a')
				cnt++;
			else ans = max(ans, cnt), cnt = 0;
		}
		ans = max(ans, cnt);
		res = min(res, ans);
	}
	cout << res << "\n";

	return 0;
}

### Prompt

Your task is to create 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;

int main()
{
	ios::sync_with_stdio(false);

	string s;
	cin >> s;
	int n = s.size();
	int res = n;
	for (int x=0; x<26; x++)
	{
		int ans = 0, cnt = 0;
		for (int i=0; i<n; i++)
		{
			if (x != s[i] - 'a')
				cnt++;
			else ans = max(ans, cnt), cnt = 0;
		}
		ans = max(ans, cnt);
		res = min(res, ans);
	}
	cout << res << "\n";

	return 0;
}

```