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 f(c):
    return ord(c) - ord('a')
def main():
    s = input() + '#'
    k = [0 for i in range(26)]
    w = [1 for i in range(26)]
    for i in range(len(s)):
        for j in range(26):
            if s[i] == '#' or f(s[i]) == j:
                k[j] = max(k[j], w[j])
                w[j] = 1
            else:
                w[j] += 1
    print(min(*k))
main()