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;
  while (cin >> s) {
    int ans = 1e6;
    for (int i = 'a'; i <= 'z'; i++) {
      int t = 0, k = 0;
      for (int j = 0; j < s.length(); j++) {
        if (s[j] == i)
          t = 0;
        else
          t++;
        k = max(k, t);
      }
      ans = min(ans, k);
    }
    cout << ans + 1 << endl;
  }
  return 0;
}
