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;
const int N = 2e5 + 5;
string s;
bool check(int len, char c) {
  int j = -1;
  for (int i = 0; i <= s.size(); i++)
    if (i == s.size() || s[i] == c) {
      if (i - j > len) return 0;
      j = i;
    }
  return j >= 0;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> s;
  int k = s.size();
  for (char ch = 'a'; ch <= 'z'; ch++) {
    int d = 1, c = k, vt = k;
    while (d <= c) {
      int mid = (d + c) >> 1;
      if (check(mid, ch))
        vt = mid, c = mid - 1;
      else
        d = mid + 1;
    }
    k = min(k, vt);
  }
  cout << k << "\n";
  return 0;
}
