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;
char s[100005];
int main() {
  scanf("%s", s + 1);
  int ans = 100005, len = strlen(s + 1);
  for (char c = 'a'; c <= 'z'; c++) {
    int pre = 0, k = -1;
    for (int i = 1; i <= len; i++) {
      while (s[i] != c && i <= len) {
        i++;
      }
      k = max(k, i - pre);
      pre = i;
    }
    if (k != -1) ans = min(ans, k);
  }
  printf("%d\n", ans);
  return 0;
}
