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() {
  long long int j, k, len, l, r, flag = 0;
  string s;
  cin >> s;
  len = s.length();
  vector<int> con;
  for (char i = 'a'; i <= 'z'; i++) {
    for (j = 0; j < len; j++) {
      if (s[j] == i) con.push_back(j);
    }
    if (con.empty()) continue;
    l = (len - 1 - con.back() > con.front()) ? len - con.back()
                                             : con.front() + 1;
    vector<int>::iterator it;
    for (it = con.begin() + 1; it != con.end(); it++) {
      if (l < (*it - *(it - 1))) {
        l = *it - *(it - 1);
      }
    }
    if (flag == 0) {
      k = l;
      flag = 1;
    }
    if (k > l) {
      k = l;
    }
    con.clear();
  }
  cout << k;
}
