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()
dc={}
dm={}
n=len(s)
for k in range(n):
    l=s[k]
    if l not in dc:
        dm[l]=k+1
    else:
        dm[l]=max(dm[l],k-dc[l])
    dc[l]=k
  #  print l, dm, dc
for k in dm.keys():
    dm[k]=max(dm[k],n-dc[k])

print min(dm.values())
