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()
st=[-1 for i in range(26)]
gap=[0 for i in range(26)]
n=len(s)
for i in range(n):
    r=i-st[ord(s[i])-97]
    gap[ord(s[i])-97] =max(gap[ord(s[i])-97],r)
    st[ord(s[i])-97]=i
ans=n
t=0
for i in gap:
    i=max(i,n-st[t])
    if i!=0:
        ans=min(ans,i)
    t+=1
print(ans)