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()
d={}
n=len(s)
for i in range(n):
    t=s[i]
    try:
        d[t].append(i+1)
    except KeyError:
        d[t]=[0,i+1]
ma=99999999
for i in d:
    l=d[i]
    l.append(n+1)
    to=0
    for j in range(1,len(l)):
        to=max(to,l[j]-l[j-1])
    ma=min(ma,to)
print(ma)
    
