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 = str(input())
s = list(s)
n = len(s)
S = set(s)
S = list(S)
N = len(S)
l = [[] for i in range(N)]
r = [-1 for i in range(N)]
for i in range(n):
    for j in range(N):
        if s[i] == S[j]:
            l[j].append(i)
            break
for i in range(N):
    l[i] = [-1] + l[i] + [n]
for i in range(N):
    for j in range(1,len(l[i])):
        r[i] = max(r[i], l[i][j] - l[i][j - 1])
print(min(r))