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()
a=96
b=0
d=100000000000
for i in range(26):
      a=a+1
      c=b=0
      for j in range(len(s)):
            if s[j] == chr(a):
                  c=0
            else:
                  c=c+1
                  if(b < c):
                        b = c
      if(b < d):
            d = b
print(d+1)
            
