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;
void solve() {
  string s;
  cin >> s;
  int ans = INT_MAX;
  for (int i = 'a'; i <= 'z'; i++) {
    int k = 0, it = -1;
    for (int j = 0; j < s.size(); j++) {
      if (s[j] == i) {
        k = max(k, j - it);
        it = j;
      }
    }
    k = max(k, (int)s.size() - it);
    ans = min(ans, k);
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
