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() {
  string s;
  int ans = 1e9;
  vector<int> A;
  cin >> s;
  for (int i = 0; i < s.size(); i++)
    if (find(A.begin(), A.end(), s[i]) == A.end()) {
      int x = -1, j = 0;
      for (int u = 0; u < s.size(); u++)
        if (s[u] == s[i]) j = max(j, abs(u - x)), x = u;
      j = max(j, int(s.size()) - x);
      ans = min(ans, j);
      A.push_back(s[i]);
    }
  cout << ans;
  return 0;
}
