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;
long long n, ans = 2e18;
string s;
int main() {
  cin >> s;
  n = s.size();
  long long l = 1, r = n / 2 + 1;
  for (long long ci = 0; ci < 26; ci++) {
    char c = char(ci + 'a');
    long long loc = -1, len = 0;
    for (long long i = 0; i < n; i++) {
      if (s[i] == c) len = max(len, i - loc + 1), loc = i;
    }
    if (len == 0) continue;
    len = max(len, n - loc + 1);
    ans = min(ans, len - 1);
  }
  cout << ans;
  return 0;
}
