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 = 1e6;
int cnt[1000];
char str[maxn];
char temp[maxn];
int main() {
  while (gets(str)) {
    int len = strlen(str);
    strcpy(temp, str);
    sort(temp, temp + len);
    int u = unique(temp, temp + len) - temp;
    int ans = 1e7;
    for (int i = 0; i < u; i++) {
      bool flag = false;
      int pos;
      int ans2;
      for (int j = 0; j < len; j++) {
        if (!flag && str[j] == temp[i]) {
          flag = true;
          ans2 = j + 1;
          pos = j;
        } else if (flag && str[j] == temp[i]) {
          ans2 = max(ans2, j - pos);
          pos = j;
        }
      }
      for (int j = len - 1; j >= 0; j--) {
        if (str[j] == temp[i]) {
          ans2 = max(len - j, ans2);
          break;
        }
      }
      ans = min(ans, ans2);
    }
    printf("%d\n", ans);
  }
  return 0;
}
