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, klu, kld, kll, klr;
vector<int> p[26];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  int n = s.size();
  for (int i = 0; i < n; ++i) {
    p[s[i] - 'a'].push_back(i);
  }
  for (int i = 0; i < 26; ++i) p[i].push_back(n);
  int anss = n;
  for (int i = 0; i < 26; ++i) {
    int ans = 0;
    int last = -1;
    for (int j = 0; j < p[i].size(); ++j) {
      ans = max(ans, p[i][j] - last);
      last = p[i][j];
    }
    anss = min(anss, ans);
  }
  cout << anss;
}
