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