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 n;
string s;
bool isdom(int k) {
  int a[26], inter = 0;
  memset(a, 0, sizeof(a));
  for (int i = 0; i < k; i++) {
    a[s[i] - 'a']++;
    inter |= 1 << (s[i] - 'a');
  }
  for (int i = k; i < n; i++) {
    a[s[i - k] - 'a']--;
    a[s[i] - 'a']++;
    for (int j = 0; j < 26; j++) {
      if (a[j] == 0) inter &= (~(1 << j));
    }
  }
  return inter;
}
int main() {
  cin >> s;
  n = s.size();
  int l = 0, r = (n + 2) / 2;
  while (l < r) {
    int m = l + (r - l) / 2;
    if (!isdom(m))
      l = m + 1;
    else
      r = m;
  }
  cout << l << "\n";
  return 0;
}
