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], b[26], v[26], ans = 1000000;
int main() {
  string s;
  cin >> s;
  int n = s.length();
  for (int i = 1; i <= n; i++) {
    int x = s[i - 1] - 'a';
    b[x] = max(b[x], i - a[x]);
    a[x] = i;
  }
  for (int i = 0; i < 26; i++) {
    b[i] = max(n + 1 - a[i], b[i]);
    if (b[i] == 0) continue;
    ans = min(b[i], ans);
  }
  cout << ans;
  return 0;
}
