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;
vector<int> v[26];
int main() {
  string s;
  cin >> s;
  int size = (int)s.size();
  for (int i = 0; i < size; ++i) {
    v[s[i] - 'a'].push_back(i);
  }
  int ans = size;
  for (int i = 0; i < 26; ++i) {
    int h = 1;
    int past = -1;
    int sizesmall = v[i].size();
    for (int j = 0; j < (int)sizesmall; ++j) {
      h = max(h, v[i][j] - past);
      past = v[i][j];
    }
    if (sizesmall > 0) {
      h = max(size - v[i][sizesmall - 1], h);
      ans = min(ans, h);
    }
  }
  cout << ans << endl;
}
