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()#abacaba
sett = set(s)
l=[]
for i in sett:
    temp = s
    k = temp.find(i) + 1
    while temp.find(i) != -1:
        temp = temp[temp.find(i) + 1:]
        k =max(k , temp.find(i)+1)
    if k < len(temp) + 1:
        k = len(temp) + 1
    l.append(k)
print(min(l))
