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()
ss=set(s)
def dist(s,l):
    pos=-1
    lastpos=-1
    dst=1
    for c in s:
        pos+=1
        if (pos-lastpos+1>dst) and c!=l:
            dst=pos-lastpos+1
        elif c==l:
            lastpos=pos
    return dst

print min([dist(s,l) for l in ss])
