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;
string s;
void solve() {
  cin >> s;
  n = s.length();
  long long ans = 1e18;
  for (char ch = 'a'; ch <= 'z'; ch++) {
    long long pre = -1, lans = -1;
    for (int i = 0; i < n; i++)
      if (s[i] == ch) lans = max(lans, i - pre), pre = i;
    lans = max(lans, n - pre);
    ans = min(ans, lans);
  }
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(20);
  cout << fixed;
  solve();
}
