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()
alpha=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
ans=1000000
for i in alpha:
	occ=[]
	for j in range(len(s)):
		if(s[j]==i):
			occ.append(j)
	occ.append(len(s))		
	diff=[]
	st=0
	# print(occ)
	for k in occ:
		diff.append(k-st)
		st=k
	diff[0]+=1
	# diff.append(len(s)-1-k)
	# print(diff)
	z=max(diff)
	# print(z)
	ans=min(max(diff),ans)
print(ans)
