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()
c=dict.fromkeys(list('abcdefghijklmnopqrstuvwxyz'),-1)
r=dict.fromkeys(list('abcdefghijklmnopqrstuvwxyz'),0)
for i in range(len(s)):
    a=s[i]
    x=i-c[a]
    if x>r[a]:
        r[a]=x
    c[a]=i
d=len(s)
for i in c.keys():
    x=d-c[i]
    if x>r[i]:
        r[i]=x
#for i in r.values():
#    if (i!=0) and (i<d):
#        d=i
d=min(r.values())
print(d)