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 main() {
  string s;
  cin >> s;
  int cnt[256] = {};
  int cntm[256] = {};
  for (int i = 0; i < s.size(); i++) {
    for (int c = 0; c < 256; c++) {
      if (c != s[i])
        cnt[c]++;
      else
        cnt[c] = 0;
      if (cnt[c] > cntm[c]) cntm[c] = cnt[c];
    }
  }
  int min = s.length() - 1;
  for (int i = 0; i < 256; i++) {
    if (cntm[i] < min) min = cntm[i];
  }
  cout << min + 1;
  getchar();
  getchar();
  return 0;
}
