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
from sys import stdin
alphabet = "abcdefghijklmnopqrstuvwxyz"

stuff = stdin.readline().strip()

totalMaxDist = len(stuff)
for alpha in alphabet:
        newstuff = alpha + stuff + alpha
        distance = 0
        maxdist = 0
        for character in newstuff:
#               print character, alpha
                distance += 1
                if character == alpha:
                        maxdist = max(maxdist,distance)
                        distance = 0
        if totalMaxDist > maxdist:
                totalMaxDist = maxdist
print totalMaxDist