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;
  vector<int> last(300, -1);
  vector<int> mx(300);
  vector<int> vis(300);
  int i = 0;
  while (s[i]) {
    vis[s[i]] = 1;
    mx[s[i]] = max(mx[s[i]], i - last[s[i]]);
    last[s[i]] = i;
    i++;
  }
  int sL = s.length();
  int ans = sL;
  for (int i = 'a'; i <= 'z'; i++) {
    if (vis[i]) {
      mx[i] = max(mx[i], sL - last[i]);
      ans = min(ans, mx[i]);
    }
  }
  cout << ans;
  return 0;
}
