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 MOD = (1e9) + 7;
const long long inf = 1e17;
const int offset = 3000;
string s;
int check(int w) {
  char c = w + 'a';
  int pre = -1;
  int i;
  int temp = INT_MIN;
  for (i = 0; i < s.size(); i++) {
    if (s[i] == c) {
      temp = max(temp, i - pre);
      pre = i;
    }
  }
  temp = max(temp, i - pre);
  return temp;
}
int main() {
  cin >> s;
  int ans = INT_MAX;
  for (int i = 0; i < 26; i++) {
    ans = min(ans, check(i));
  }
  cout << ans;
  return 0;
}
