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
# -*- coding: utf-8 -*-
def writeline(l): print " ".join(map(str, l))
def readline(): return map(int, raw_input().split())
def readint(): return int(raw_input(), 10)


def main():
    string = raw_input()
    last_pos, max_step = dict(), dict()
    for pos, symbol in enumerate(string):
        max_step[symbol] = max(max_step.get(symbol, -1),
                               pos - last_pos.get(symbol, -1))
        last_pos[symbol] = pos

    pos = len(string)
    for symbol in last_pos:
        max_step[symbol] = max(max_step[symbol],
                               pos - last_pos[symbol])

    print min(max_step.values())


main()
