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 = str(input())
tot = len(s)
count = [-1]*26
temp = [0]*26
for i in range (0,tot):
    for j in range (0,26):
        if j != ord(s[i])-ord("a"):
            temp[j] += 1
        elif j == ord(s[i])-ord("a"):
            temp[j] +=1
            count[j] = max(count[j],temp[j])
            temp[j] = 0
for j in range (0,26):
    if count[j] !=0:
        count[j] = max(count[j], temp[j]+1)
print(min(count))