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

string = input()

k = 1000000
for c in range(ord('a'), ord('z')+1):
    c = chr(c)

    kc = 0
    length = 0
    for i in range(0, len(string)):
        if string[i] == c:
            kc = max([kc, length])
            length = 0
        else:
            length += 1
    kc = max([kc, length])
    k = min([kc, k])

print(k+1)