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()
d = {};
for i in range(26):
	d[chr(ord('a') + i)] = [-1];

for i in range(len(s)):
	d[s[i]].append(i);
	#print s[i],i,d[s[i]];
for x in d:
	d[x].append(len(s));
ans = len(s);

for x in d:
	temp = -1;
	for i in range(len(d[x]) - 1):
		temp = max(d[x][i+1]-d[x][i],temp);
	ans = min(ans,temp);

print ans;