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;
const int maxn = 1e5 + 5;
char s[maxn];
int main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  int minx = len;
  for (int i = 0; i < 26; i++) {
    int pos = 0;
    int ans = 0;
    for (int j = 1; j <= len; j++) {
      if ((s[j] - 'a') == i) {
        ans = max(ans, j - pos);
        pos = j;
      }
    }
    ans = max(len - pos + 1, ans);
    minx = min(minx, ans);
  }
  printf("%d\n", minx);
  return 0;
}
