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
inp = input()
s = set(inp)
n = len(s)
li = []
for x in s:
    seq = inp.split(x)
    maxm = len(seq[0])
    for x in seq:
        maxm = max(maxm, len(x))
    li.append(maxm + 1)
print(min(li))