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 = raw_input()
n = len(s)
alpha = 'abcdefghijklmnopqrstuvwxyz'
s = '.'+s
l = {a:0 for a in alpha}
last = {b:0 for b in alpha}
for i in range(1,n+1):
    l[s[i]] = max(i - last[s[i]], l[s[i]])
    last[s[i]] = i
#print l
for aa in l:
    l[aa] = max(n - last[aa]+1, l[aa])
#print last
print min(l.values())