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;
const int maxn = 200005;
string s;
void Solve() {
  cin >> s;
  int n = s.size(), minn = 1e9;
  s = " " + s;
  for (int i = ('a'); i <= ('z'); i++) {
    int l = 1, k = 1;
    for (int j = (1); j <= (n); j++)
      if (s[j] == i) {
        l = max(l, k);
        k = 1;
      } else
        k++;
    l = max(l, k);
    minn = min(minn, l);
  }
  cout << minn;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) Solve();
}
