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;
const int INF = 1e9 + 23;
const int MOD = 1e9 + 7;
string s;
string t;
char ch;
int x, ans, res = INF, n;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  n = s.size();
  char ch;
  for (int i = 0; i < 26; i++) {
    ch = 'a' + i;
    t = ch + s + ch;
    ans = 0;
    x = 0;
    for (int j = 0; j <= n + 1; j++) {
      if (t[j] == ch) {
        ans = max(ans, x);
        x = 0;
      }
      x++;
    }
    res = min(ans, res);
  }
  cout << res;
  return 0;
}
