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 ans = 123456;
  for (int i = 0; i < 26; i++) {
    char c = i + 'a';
    int lma = 0;
    int lst = -1;
    for (int j = 0; j < s.size(); j++) {
      if (s[j] == c) {
        lma = max(lma, j - lst);
        lst = j;
      }
    }
    lma = max(lma, (int)s.size() - lst);
    ans = min(ans, lma);
  }
  cout << ans;
  return 0;
}
