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;
int a[26], last[26];
int main() {
  string s;
  cin >> s;
  int n = s.size();
  memset(a, 0x3f, sizeof(a));
  for (int i = 0; i < n; ++i) {
    if (a[s[i] - 'a'] == 0x3f3f3f3f) {
      a[s[i] - 'a'] = i + 1;
    } else {
      a[s[i] - 'a'] = max(a[s[i] - 'a'], i - last[s[i] - 'a']);
    }
    last[s[i] - 'a'] = i;
  }
  int ans = 0x3f3f3f3f;
  for (int i = 0; i < 26; ++i) {
    a[i] = max(n - last[i], a[i]);
    ans = min(ans, a[i]);
  }
  cout << ans << endl;
  return 0;
}
