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;
int solve(char c) {
  int pos = -1;
  int ans = 0;
  s.push_back(c);
  for (int i = 0; i < s.length(); i++) {
    if (s[i] == c) {
      ans = max(ans, i - pos);
      pos = i;
    }
  }
  s.pop_back();
  return ans;
}
int main() {
  cin >> s;
  int k = 1000000;
  for (char c = 'a'; c <= 'z'; c++) k = min(k, solve(c));
  cout << k;
}
