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=raw_input()
n=len(s)
ans=n
a="abcdefghijklmnopqrstuvwxyz"
for i in a:
    x=[0]
    for j in range(n):
        if s[j]==i:
            x.append(j+1)
    x.append(n+1)
    if len(x)==0:
        continue
    else:
        p=0
        for j in range(1,len(x)):
            p=max(p,x[j]-x[j-1])
        ans=min(ans,p)
print ans
