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().strip()

memomin = dict()
memolast = dict()

for i,e in enumerate(s):
    if e not in memomin:
        memomin[e] = i+1
        memolast[e] = i
    else:
        memomin[e] = max(memomin[e], i - memolast[e])
        memolast[e] = i

for e in memomin:
    memomin[e] = max(memomin[e], len(s) - memolast[e])

print(min(memomin.values()))

