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
#!/usr/bin/env python3

S = [ord(c)-ord('a') for c in input()]
K = [float('inf')]*26
L = [None]*26
# distances au debut et entre occurences consecutives
for i in range(len(S)):
    if L[S[i]]==None:
        K[S[i]] = i+1
    elif i-L[S[i]]>K[S[i]]:
        K[S[i]] = i-L[S[i]]
    L[S[i]] = i
# distances a la fin
for i in range(26):
    if L[i]!=None and len(S)-L[i]>K[i]:
        K[i] = len(S)-L[i]
print(min(K))
