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 l[27], r[27], t = 0x3f3f3f3f;
char s[1000005];
int main() {
  scanf("%s", s + 1);
  int c = strlen(s + 1);
  for (int i = 1; i <= c; i++) {
    int id = s[i] - 97;
    l[id] = max(l[id], i - r[id]);
    r[id] = i;
  }
  for (int i = 0; i < 26; i++) l[i] = l[i] == 0 ? 0 : max(l[i], c + 1 - r[i]);
  for (int i = 0; i < 26; i++) t = l[i] == 0 ? t : min(t, l[i]);
  cout << t;
}
