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[100], b[100];
int main() {
  ios::sync_with_stdio(false);
  int n, res(INT32_MAX), x = 0, y = 0;
  char ch;
  string s;
  cin >> s;
  for (int i = 0; i < s.length(); i++) {
    for (int j = 0; j < 26; j++) {
      a[j]++;
      if (j != s[i] - 'a' && a[j] > b[j]) {
        b[j] = a[j];
      }
    }
    a[s[i] - 'a'] = 0;
  }
  for (int i = 0; i < 26; i++) {
    res = min(res, b[i]);
  }
  cout << res + 1;
  return 0;
}
