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()
n=len(s)
l=[[0] for i in range(26)]
for i in range(len(s)):
    l[ord(s[i])-97].append(i+1)
ans=(len(s)//2)+1 

for i in range(26):
    l[i].append(n+1)

#print(*l[0])

for i in range(26):
    diff=-10**9 
    for j in range(1,len(l[i])):
        diff=max(l[i][j]-l[i][j-1],diff)
    if diff!=-10**9:
        ans=min(ans,diff)    
print(ans)

