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 INF = 0x7fffffff;
const int maxn = 100005;
char s[maxn];
int n;
int f(char c) {
  int last = 0, res = -1;
  for (int i = 1; i <= n; i++) {
    if (s[i] == c) {
      res = max(res, i - last);
      last = i;
    }
  }
  if (res != -1) res = max(res, n + 1 - last);
  return res == -1 ? INF : res;
}
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  int ans = INF;
  for (char i = 'a'; i <= 'z'; i++) {
    ans = min(ans, f(i));
  }
  printf("%d\n", ans);
  return 0;
}
