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 interval[26], lastPos[26];
int main() {
  ios::sync_with_stdio(false);
  string a;
  cin >> a;
  for (int i = 0; i < 26; i++) {
    interval[i] = -1;
    lastPos[i] = -1;
  }
  for (int i = 0; i < a.length(); i++) {
    int index = a[i] - 'a';
    interval[index] = max(interval[index], i - lastPos[index] - 1);
    lastPos[index] = i;
  }
  int minInterval = a.length();
  for (int i = 0; i < 26; i++) {
    if (interval[i] != -1) {
      if (lastPos[i] != a.length() - 1)
        interval[i] = max(interval[i], (int)a.length() - lastPos[i] - 1);
      if (interval[i] != -1 && interval[i] < minInterval)
        minInterval = interval[i];
    }
  }
  cout << minInterval + 1 << endl;
  return 0;
}
