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 long long int mod = 1e9 + 7;
void init() {}
void solve() {
  string s;
  cin >> s;
  vector<set<int>> k(26);
  for (int i = 0; i < 26; i++) {
    k[i].insert(s.size());
    k[i].insert(-1);
  }
  for (int i = 0; i < s.size(); i++) {
    k[s[i] - 97].insert(i);
  }
  int ans = 1e9;
  for (int i = 0; i < 26; i++) {
    int m = 0;
    int prev = 0;
    for (auto j = k[i].begin(); j != k[i].end(); j++) {
      m = max(m, *j - prev);
      prev = *j;
    }
    ans = min(ans, m);
  }
  cout << ans << endl;
}
int main() {
  init();
  int t = 1;
  while (t) {
    solve();
    --t;
  }
  return 0;
}
