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;
string s;
const int N = 1e5 + 5;
int dp[N];
bool ok(int x) {
  for (char c = 'a'; c <= 'z'; c++) {
    bool yep = true;
    memset(dp, 0, sizeof(dp));
    for (int i = 0; i < x; ++i) dp[s[i]]++;
    if (dp[c] == 0) continue;
    int cnt = 0;
    dp[cnt]--;
    for (int i = x; i < s.size(); ++i) {
      char now = s[i];
      dp[now]++;
      dp[s[cnt]]--;
      cnt++;
      if (dp[c] <= 0) {
        yep = false;
        break;
      }
    }
    if (yep) return true;
  }
  return false;
}
int main() {
  cin >> s;
  int hi = s.size();
  int lo = 0;
  int res = 0;
  while (hi >= lo) {
    int mid = (hi + lo) / 2;
    if (ok(mid)) {
      res = mid;
      hi = mid - 1;
    } else
      lo = mid + 1;
  }
  cout << res;
}
