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()
letters = set(s)
ans = len(s)
for ch in letters:
	prev = -1
	max_dist = 0
	for pos in range(len(s)):
		if s[pos] == ch:
			max_dist = max(pos - prev - 1, max_dist)
			prev = pos
	max_dist = max(len(s) - prev - 1, max_dist)
	ans = min(ans, max_dist + 1)
print(ans)

