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 main() {
  string s;
  cin >> s;
  int ans = s.length() / 2 + 1;
  for (int let = 'a'; let <= 'z'; let++) {
    int pos = -1;
    int maxi = -1;
    for (int i = 0; i < s.length(); i++) {
      if (s[i] == let) {
        if (pos == -1) {
          maxi = i + 1;
          pos = i;
        } else {
          maxi = max(maxi, i - pos);
          pos = i;
        }
      }
    }
    if (maxi != -1) {
      int f = s.length() - pos;
      maxi = max(maxi, f);
      ans = min(ans, maxi);
    }
  }
  cout << ans;
  return 0;
}
