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() {
  string s;
  cin >> s;
  int n = s.length();
  int l[30], mx[30];
  for (int i = 0; i < 30; ++i) {
    l[i] = -1;
    mx[i] = -1;
  }
  for (int i = 0; i < n; ++i) {
    int ci = s[i] - 'a';
    if (mx[ci] < i - l[ci]) {
      mx[ci] = i - l[ci];
    }
    l[ci] = i;
  }
  int m = 100100;
  for (int ci = 0; ci <= 'z' - 'a'; ++ci)
    if (l[ci] != -1) {
      if (mx[ci] < n - l[ci]) {
        mx[ci] = n - l[ci];
      }
      if (mx[ci] < m) {
        m = mx[ci];
      }
    }
  cout << m;
  return 0;
}
