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()
ans=len(s)//2+1
#print('len='+str(len(s)))
p=[-1]*26
d=[-1]*26
for i in range(len(s)):
    t=ord(s[i])-ord('a')
    d[t]=max(d[t],i-p[t])
    p[t] = i
for i in range(26):
    if p[i]<0:
        continue
    d[i]=max(d[i],len(s)-p[i])
    ans=min(ans,d[i])
print(ans)