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;
string s;
int poz, sol;
int main() {
  sol = INT_MAX;
  cin >> s;
  int n = s.size();
  for (int c = 1; c <= 26; c++) {
    char ch = c + 'a' - 1;
    poz = -1;
    int maxx = 0;
    for (int i = 0; i < n; i++) {
      if (s[i] == ch) {
        if (i - poz > maxx) maxx = i - poz;
        poz = i;
      }
    }
    if (n - poz > maxx) maxx = n - poz;
    if (sol > maxx) sol = maxx;
  }
  cout << sol;
  return 0;
}
