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
s = input()
letters = set(s)
p = dict.fromkeys(letters, [-1, -1])
for i, c in enumerate(s):
    u = max(p[c][1], i - p[c][0])
    p[c] = [i, u]
for value in p.values():
    value[1] = max(len(s) - value[0], value[1])

print(min(i[1] for i in p.values() if i[1] != -1))