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
from sys import stdin

s = stdin.readline().strip()

best = {c: -1 for c in "abcdefghijklmnopqrstuvwxyz"}

last = {c: -1 for c in "abcdefghijklmnopqrstuvwxyz"}

for i, c in enumerate(s):
    d = i - last[c]
    if best[c] < d:
        best[c] = d
    last[c] = i

s = len(s)
for c in "abcdefghijklmnopqrstuvwxyz":
    d = s - last[c]
    if d > best[c]:
        best[c] = d

#print best
#print last
print min([best[c] if best[c] != -1 else "inf" for c in best.keys()])

