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
# [last appearence,max len diff]
hash={}
s=input()
for i in range(len(s)):
  if(s[i] in hash):
    if i-hash[s[i]][0] > hash[s[i]][1]:
      hash[s[i]][1]=i-hash[s[i]][0]
    hash[s[i]][0]=i
  else:
    hash[s[i]]=[i,i+1]

chars=set([i for i in s])

for i in hash.keys():
  if((len(s))-hash[i][0]) > hash[i][1]:
    hash[i][1]=(len(s))-hash[i][0]
  hash[i][0]=len(s)-1

mini=len(s)
for i in hash.keys():
  if hash[i][1]< mini:
    mini=hash[i][1]


print(mini)