//By Don4ick
#include <bits/stdc++.h>

const int N = (int)105;

using namespace std;

string s;

int main()
{
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);

	cin >> s;    
	int ans = (int)s.size();
	for (int letter = 'a'; letter <= 'z'; letter++)
	{
		int last = (int)s.size(), res = 0;
		for (int i = (int)s.size() - 1; i >= 0; i--)
		{
			if (s[i] == letter)
				last = i;
			res = max(res, last - i);			
		}
		ans = min(ans, res);
	}	
	cout << ans << endl;

	return 0;
}


### Prompt

Generate 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
//By Don4ick
#include <bits/stdc++.h>

const int N = (int)105;

using namespace std;

string s;

int main()
{
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);

	cin >> s;    
	int ans = (int)s.size();
	for (int letter = 'a'; letter <= 'z'; letter++)
	{
		int last = (int)s.size(), res = 0;
		for (int i = (int)s.size() - 1; i >= 0; i--)
		{
			if (s[i] == letter)
				last = i;
			res = max(res, last - i);			
		}
		ans = min(ans, res);
	}	
	cout << ans << endl;

	return 0;
}


```