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()
prev=[-1]*26
dist=[0]*26
n=len(s)

for i in range(n):
    ch=ord(s[i])-ord('a')
    dist[ch]=max(dist[ch],i-prev[ch])
    prev[ch]=i

for i in range(26):
    dist[i]=max(dist[i],n-prev[i])
print(min(dist))