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 mn, n, i, j, k, l, a[28], b[27];
string s;
int main() {
  cin >> s;
  mn = n = s.length();
  for (i = 0; i < s.length(); i++) {
    b[s[i] - 'a'] = max(b[s[i] - 'a'], i + 1 - a[s[i] - 'a']);
    a[s[i] - 'a'] = i + 1;
  }
  for (i = 0; i < 26; i++) {
    mn = min(mn, max(b[i], n + 1 - a[i]));
  }
  cout << mn;
}
