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
st = input()
ans = len(st)
for ch in set(list(st)):
    last = 0
    maxdif = 0
    for i in range(len(st)):
        if ch == st[i]:
            maxdif = max(maxdif, i - last)
            last = i + 1
    ans = min(ans, max(maxdif, len(st) - last))
print(ans + 1)
