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
C = "qwertyuiopasdfghjklzxcvbnm"

s = input()
l = len(s)
mini = l+1
for c in C:
    last = -1
    max_l = 0
    for i in range(l):
        if s[i] == c:
            max_l = max(max_l, i - last)
            last = i
    max_l = max(max_l, l - last)
    mini = min(mini, max_l)
print(mini)

