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 mx, mn = 1e9, cur;
string s;
int main() {
  cin >> s;
  for (int i = 0; i < 26; i++) {
    mx = 0, cur = 0;
    for (int j = 0; j < s.size(); j++) {
      if (j == s.size() - 1 && s[j] - 'a' != i) {
        mx = max(mx, j - cur + 2);
      }
      if (s[j] - 'a' == i) {
        mx = max(mx, j - cur + 1);
        cur = j + 1;
      }
    }
    mn = min(mx, mn);
  }
  cout << mn;
  return 0;
}
