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()
letras = set(s)
resp = len(s)

for x in letras:
	ant = -1
	max_dist = 0
	
	for atual in range(len(s)):
		if s[atual] == x:
			max_dist = max(atual - ant, max_dist)
			ant = atual
			
	max_dist = max(len(s) - ant, max_dist)
	resp = min(resp, max_dist)
print(resp)
