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
string = input()
previous = []
distances = []
for i in range(26):
    previous.append(-1)
    distances.append(-1)
for count,i in enumerate(string):
    num = ord(i)-97
    currDist = count-previous[num]
    distances[num] = max(currDist,distances[num])
    previous[num] = count

for num in range(26):
    count = len(string)
    currDist = count-previous[num]
    distances[num] = max(currDist,distances[num])
print(min(distances))
