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
def main():
    s = input()
    checked = []
    l = len(s)
    mi = l // 2 + 1
    for i in range(l):
        if s[i] not in checked:
            j = i + 1
            m = i + 1
            t = i
            while j < l:
                while j < l and s[t] != s[j]:
                    j += 1
                if j - t > m:
                    m = j - t
                t = j
                j += 1
            if m < mi:
                mi = m
            checked += [s[i]]
    print(mi)

main()
