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;
  long long l = s.length();
  long long ans = INT_MAX, i, j, c = 0, x = 0;
  for (i = 0; i < 26; i++) {
    c = 0;
    x = 0;
    for (j = 0; j < l; j++) {
      if (s[j] == 'a' + i) {
        x = max(x, c + 1);
        c = 0;
      } else
        c++;
    }
    x = max(x, c + 1);
    ans = min(ans, x);
  }
  cout << ans;
  return 0;
}
