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;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cout << *it << " = " << a << endl;
  err(++it, args...);
}
vector<int> pos[26];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  int l = s.length();
  for (int i = 0; i < 26; i++) {
    pos[i].push_back(0);
  }
  for (int i = 0; i < l; i++) {
    pos[s[i] - 'a'].push_back(i + 1);
  }
  for (int i = 0; i < 26; i++) {
    pos[i].push_back(l + 1);
  }
  int mx = l;
  for (int i = 0; i < 26; i++) {
    int temp = 0;
    for (int j = 1; j < pos[i].size(); j++) {
      temp = max(temp, pos[i][j] - pos[i][j - 1]);
    }
    mx = min(mx, temp);
  }
  cout << mx;
  return 0;
}
