K-Dominant Character

2000ms

262144K

Description:

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.

Sample Input:

abacaba

Sample Output:

Sample Input:

zzzzz

Sample Output:

Sample Input:

abcde

Sample Output:

Informação

Provedor Codeforces

Código CF888C