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()
n = len(s)
min1 = n+1
for i in range(26):
	initial = -1
	max2 = 0
	for j in range(n):
		if((ord(s[j])-ord('a')) == i):
			max2 = max(max2,j-initial)
			initial = j
	max2 = max(max2,n-initial)
	# print(i,max2)
	if(initial != -1):
		min1 = min(min1,max2)
print(min1)