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 = 1e9;
  char ansc = s[0];
  for (int i = 0; i < 26; i++) {
    char c = (char)'a' + i;
    int mx = 0;
    int prev = 0;
    bool f = false;
    for (int j = 0; j < s.size(); j++) {
      if (s[j] == c && f) {
        prev = j;
      }
      mx = max(j - prev + 1, mx);
      if (s[j] == c && !f) {
        prev = j;
        f = true;
      }
    }
    if (f) {
      if (mx < ans) {
        ans = mx;
        ansc = c;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
