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
from copy import copy
s = input()
alphabet = 'qwertyuioplkjhgfdsazxcvbnm'
anss = len(s)
for sim in alphabet:
    x = copy(s)
    x = x.split(sim)
    ans = 0
    for i in x:
        ans = max(ans, len(i))
    anss = min(anss, ans)
print(anss + 1)