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
# Main maut ko takiya, aur kafan ko chaadar anakar audhta hoon!

s=input()

abc=list(set(s))

ans=100000000000

for i in abc:
	ans=min(max(map(len,s.split(i)))+1,ans)
	
print(ans)