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
Str = input()
Ln = len(Str)

lastIndex = {}
maxDist = {}

for i in range(Ln):
	if (not Str[i] in lastIndex):
		lastIndex[Str[i]] = i
		maxDist[Str[i]] = i+1
	else:
		maxDist[Str[i]] = max(maxDist[Str[i]], i-lastIndex[Str[i]])
		lastIndex[Str[i]] = i
for i in lastIndex:
	maxDist[i] = max(Ln-lastIndex[i], maxDist[i])

Min = -1
for i in maxDist:
	if (Min == -1 or maxDist[i] < Min):
		Min = maxDist[i]

print (Min)