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 str;
  cin >> str;
  long long i, maxi[26] = {0};
  map<long long, long long> mp;
  long long n = str.size();
  for (i = 0; i < n; i++) {
    long long a = mp[str[i]];
    mp[str[i]] = i + 1;
    char c = str[i];
    maxi[c - 'a'] = max(maxi[c - 'a'], i + 1 - a);
  }
  for (i = 0; i < 26; i++) {
    maxi[i] = max(maxi[i], n + 1 - mp['a' + i]);
  }
  sort(maxi, maxi + 26);
  cout << maxi[0];
  return 0;
}
