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()

last = {}
keys = {}
key = 1000000

i = 0
for c in s:
	if c not in keys.keys():
		last[c] = -1
		keys[c] = 0

	keys[c] = max(keys[c], i - last[c])
	last[c] = i
	# print c + "'s %d", keys[c]
	i = i + 1

for c in keys.keys():
	keys[c] = max(keys[c], len(s) - last[c])
	key = min(keys[c], key)

print key