//In the Name of God
//Ya Ali

#include<bits/stdc++.h>

#define err(A) cout<<#A<<" = "<<(A)<<endl

using namespace std;

int main()
{
  ios::sync_with_stdio(0);cin.tie(0);

  string s;
  cin>>s;

  int ans=s.size();
  for(int j=0;j<26;j++)
    {
      int tmp=0;
      int b=0;
      for(int i=0;i<s.size();i++)
	{
	  if(s[i]-'a'!=j)
	    {
	      b++;
	      tmp=max(tmp,b);
	    }
	  else
	    b=0;
	}
      ans=min(ans,tmp);
    }

  cout<<ans<<endl;
  
  return 0;
}

### Prompt

Your challenge is to write 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
//In the Name of God
//Ya Ali

#include<bits/stdc++.h>

#define err(A) cout<<#A<<" = "<<(A)<<endl

using namespace std;

int main()
{
  ios::sync_with_stdio(0);cin.tie(0);

  string s;
  cin>>s;

  int ans=s.size();
  for(int j=0;j<26;j++)
    {
      int tmp=0;
      int b=0;
      for(int i=0;i<s.size();i++)
	{
	  if(s[i]-'a'!=j)
	    {
	      b++;
	      tmp=max(tmp,b);
	    }
	  else
	    b=0;
	}
      ans=min(ans,tmp);
    }

  cout<<ans<<endl;
  
  return 0;
}

```