You are given a string s consisting of lowercase Latin letters. Character c is called k-dominant iff each substring of s with length at least k contains this character c.

You have to find minimum k such that there exists at least one k-dominant character.

Input

The first line contains string s consisting of lowercase Latin letters (1 ≤ |s| ≤ 100000).

Output

Print one number — the minimum value of k such that there exists at least one k-dominant character.

Examples

Input

abacaba


Output

2


Input

zzzzz


Output

1


Input

abcde


Output

3
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  string s;
  cin >> s;
  n = s.size();
  std::vector<int> latestpos(130, -1), maxdiff(130, 0);
  for (int i = 0; i < s.size(); i++) {
    if (i - latestpos[s[i]] > maxdiff[s[i]])
      maxdiff[s[i]] = i - latestpos[s[i]];
    latestpos[s[i]] = i;
  }
  for (int i = 97; i <= 122; i++) {
    if (n - latestpos[i] > maxdiff[i]) maxdiff[i] = n - latestpos[i];
    latestpos[i] = 234;
  }
  for (int i = 0; i < maxdiff.size(); i++) {
    if (maxdiff[i] == 0) maxdiff[i] = 1e7;
  }
  cout << *min_element(maxdiff.begin(), maxdiff.end()) << endl;
}
