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;
string s;
vector<int> vv[30];
int main() {
  cin >> s;
  int len = s.size();
  for (int i = 0; i < len; i++) {
    vv[s[i] - 'a'].push_back(i + 1);
  }
  int minn = 123456;
  for (int i = 0; i < 26; i++) {
    if (vv[i].size() != 0) {
      int tt = vv[i].size();
      int maxx = vv[i][0];
      for (int j = 1; j < tt; j++) {
        maxx = max(maxx, vv[i][j] - vv[i][j - 1]);
      }
      maxx = max(maxx, len + 1 - vv[i][tt - 1]);
      minn = min(minn, maxx);
    }
  }
  printf("%d\n", minn);
  return 0;
}
