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 main() {
  char a[111111];
  cin >> a;
  int m = 999999;
  int i, j;
  for (i = 0; i < 26; i++) {
    int cnt = 1, ma = 1;
    for (j = 0; a[j] != '\0'; j++) {
      if (a[j] == i + 'a')
        cnt = 1;
      else {
        cnt++;
        ma = max(cnt, ma);
      }
    }
    m = min(m, ma);
  }
  cout << m;
}
