#include <bits/stdc++.h>
using namespace std;
char s[101010];
int l[30], r[30], ans = 0x3f3f3f3f;
int main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  for (int i = 1; i <= len; i++) {
    int now = s[i] - 'a';
    l[now] = max(l[now], i - r[now]);
    r[now] = i;
  }
  for (int i = 0; i < 26; i++) {
    if (l[i] != 0) {
      l[i] = max(l[i], len - r[i] + 1);
    }
  }
  for (int i = 0; i < 26; i++) {
    if (l[i] != 0) {
      ans = min(ans, l[i]);
    }
  }
  printf("%d\n", ans);
  return 0;
}

### Prompt

Your challenge is to write a Cpp solution to the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
char s[101010];
int l[30], r[30], ans = 0x3f3f3f3f;
int main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  for (int i = 1; i <= len; i++) {
    int now = s[i] - 'a';
    l[now] = max(l[now], i - r[now]);
    r[now] = i;
  }
  for (int i = 0; i < 26; i++) {
    if (l[i] != 0) {
      l[i] = max(l[i], len - r[i] + 1);
    }
  }
  for (int i = 0; i < 26; i++) {
    if (l[i] != 0) {
      ans = min(ans, l[i]);
    }
  }
  printf("%d\n", ans);
  return 0;
}

```