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.
The first line contains string *s* consisting of lowercase Latin letters (1 ≤ |*s*| ≤ 100000).
none
abacaba
2
zzzzz
1
abcde
3
bcaccacaaabaacaabaaabcbbcbcaacacbcbaaaacccacbbcbaabcbacaacbabacacacaccbbccbcbacbbbbccccabcabaaab
8
daabcdabbabbacacbaacabacbcaabaacac
4
abghim
4
gfliflgfhhdkceacdljgkegmdlhcgkcmlelmbbbmdddgdeeljjhgbbffmemmmkhebgkhadkdajabcjkcgbkgbaeacdedlkklfech
17
a
1
aaabbb
4
ab
2
abbb
2
ob
2
abccba
3
saaaaaaaas
2
axxx
2
abcba
2
abb
2
abcdea
4
axcbb
3
tmivvdcbbfrfogjviirrximhttoskopwrcmkcborcxvr
13
dlchmmuateksgldkckljrovmeuniobjrelqjpnjljlvhpqrjsfklliqpufplgaelevmlcnodbllquubobecem
15
zx
2
zxz
2
bbhdgaefbhf
6
xx
1
zxx
2
cbcada
4
z
1
aab
2
jficc
3
cceeaabfba
5
jk
2
lzeznbwu
5
rr
1
def f(k):
  a = [0] * 26
  for i in range(k):
    code = ord(s[i]) - ord("a")
    a[code] += 1
  mina = [0] * 26
  for i in range(26):
    mina[i] = a[i]
  for i in range(1, n - k + 1):
    code1 = ord(s[i - 1]) - ord("a")
    a[code1] -= 1
    code2 = ord(s[i + k - 1]) - ord("a")
    a[code2] += 1
    mina[code1] = min(mina[code1], a[code1])
    mina[code1] = min(mina[code1], a[code1])
  if sum(mina) != 0:
    return True
  return False
  
s = input()
n = len(s)
l = 0
r = len(s) + 1
while r - l > 1:
  m = (l + r) // 2
  if f(m) == True:
    r = m
  else:
    l = m
print(r)
# Sat Mar 26 2022 14:29:32 GMT+0000 (Coordinated Universal Time)
