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
inp=lambda:map(int,input().split())
s=input()

l=len(s)
lab=[0]*27
m=[-1]*27

for i in range(27):
    fl=0
    d=0
    for j in range(l):
        if s[j]==chr(i+ord('a')):
            fl=1
            break

    k=j

    if fl==0: continue

    fl=0
    for j in range(k+1,l):
      if s[j]!=chr(i+ord('a')):
          d+=1
      else:
          fl=1
          m[i]=max(m[i],d+1)
          d=0
          last=j

   

    if fl==0:
        m[i]=max(k+1,l-k)
    else:
        m[i]=max(m[i],k+1,l-last)

r=10000000

for i in range(27):
    if m[i]>=0: 
        r=min(r,m[i]);

print(r)
