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
a = input()

S = [[-1] for i in range(26)]

for i in range(len(a)):
    S[ord(a[i])%97] += [i]
for i in range(len(S)):
    S[i] += [len(a)]
min = [-1 for i in range(26)]
#print(S)
for i in range(26):
    for j in range(1, len(S[i])):
        if min[i] < S[i][j] - S[i][j-1]:
            min[i] = S[i][j] - S[i][j-1]
m = 10**6
for i in min:
    if i != -1 and i < m:
        m = i
print(m)