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()
s1=set()
for i in s:
    s1.add(i)
l1=list(s1)
an=len(s)
for i in l1:
    st=-1
    mx=0
    for j in range(len(s)):
        if s[j]==i:
            mx=max(mx,j-st)
            st=j
    mx=max(mx,len(s)-st)
    an=min(an,mx)
print(an)