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 x, y, z, ans = 200000;
int main() {
  string str;
  cin >> str;
  for (char a = 'a'; a <= 'z'; a++) {
    for (int i = 0; i <= str.size(); i++) {
      x = max(x, ++y);
      (str[i] == a) ? y = 0 : 0;
    }
    ans = min(ans, x);
    y = 0, x = 0;
  }
  cout << ans;
  return 0;
}
