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
MOD = 1000000007
ii = lambda : int(input())
si = lambda : input()
dgl = lambda : list(map(int, input()))
f = lambda : map(int, input().split())
il = lambda : list(map(int, input().split()))
ls = lambda : list(input())
s=si()
n=len(s)
mn=n+10
for i in 'abcdefghijklmnopqrstuvwxyz':
    pi=0
    mx=0
    for j in range(n):
        if s[j]==i:
            mx=max(mx,j-pi+1)
            pi=j+1
    mx=max(mx,n-pi+1)
    mn=min(mn,mx)
print(mn)