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
import sys
import math

def check(L):
    vis = [True for i in range(26)]
    cnt = [0 for i in range(26)]
    for i in range(L):
        val = s[i]
        cnt[val] += 1
    for i in range(len(cnt)):
        if not cnt[i]:
            vis[i] = False
    for i in range(L, len(s)):
        val = s[i]
        cnt[val] += 1
        val = s[i-L]
        cnt[val] -= 1
        if not cnt[val]:
            vis[val] = False
    for i in vis:
        if i:
            return True
    return False

s = list(map(lambda x: ord(x)-ord('a'), input()))
l = 0
r = len(s)
while r > l:
    mid = (l + r) >> 1
    if check(mid):
        r = mid
    else:
        l = mid+1

print(l)