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()
n = len(s)
d = [n + 1] * 26
pre = [-1] * 26
for i in range(n):
    now = ord(s[i]) - ord('a')
    if pre[now] < 0:
        d[now] = i + 1
    else:
        d[now] = max(d[now], i - pre[now])
    pre[now] = i
for i in range(26):
    d[i] = max(d[i], n - pre[i])
print(min(d))


 		    	    		 	   	  		 	  		