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 = '!' + input()

m = set(s)
d = {}
d1 = {}
for x in range(1, len(s)):
    if not s[x] in d:
        d[s[x]] = x
    else:
        d[s[x]] = max(d[s[x]], x - s[:x].rindex(s[x]))
    d1[s[x]] = x

for (x, y) in d.items():
    d[x] = max(d[x], len(s) - d1[x])

print(min(d.values()))
