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;
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  string s;
  cin >> s;
  long long ans = (long long)(s.size());
  vector<long long> alpha[26];
  for (long long i = 0; i < (long long)(s.size()); i++) {
    alpha[s[i] - 'a'].push_back(i);
  }
  for (long long i = 0; i < 26; i++) {
    if ((long long)(alpha[i].size()) == 0) continue;
    long long mx =
        max((long long)(s.size()) - alpha[i].back(), alpha[i][0] + 1);
    for (long long j = 1; j < (long long)(alpha[i].size()); j++) {
      mx = max(mx, alpha[i][j] - alpha[i][j - 1]);
    }
    ans = min(mx, ans);
  }
  cout << ans << "\n";
}
