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>
int main() {
  char c;
  int i, n = 0, x, min = 100000, k_dom[26][2] = {0};
  while (scanf("%c", &c) && c != '\n' && ++n) {
    if ((x = n - k_dom[c - 'a'][1]) > k_dom[c - 'a'][0]) {
      k_dom[c - 'a'][0] = x;
    }
    k_dom[c - 'a'][1] = n;
  }
  for (i = 0; i < 26; i++) {
    if ((x = n + 1 - k_dom[i][1]) > k_dom[i][0]) k_dom[i][0] = x;
    if (k_dom[i][0] < min) min = k_dom[i][0];
  }
  printf("%d", min);
}
