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
def lc(string):
    ans = 1000000000
    real = {}
    fake = {}
    
    i = 0
    for x in string:
        
        if x not in fake:
            fake[x]=i
            real[x] = max(real.get(x,0),i+1)
        else:
            val = i - fake.get(x,0)
            fake[x] = i
            real[x] = max(real.get(x,0),val)
        i+=1
    
    for x in real:
        val = len(string) - fake.get(x,0)
        fake[x] = i
        real[x] = max(real.get(x,0),val)
    for x in real:
        ans = min(ans,real[x])
    else:
        return ans

    

print(lc(input()))
            