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
import java.util.Scanner;

import static java.lang.Math.max;
import static java.lang.Math.min;

public class Dominanta {
    public static void main(String[] args) {
            String s;
            Scanner sc = new Scanner(System.in);  //подключение сканера !!! ОБЯЗАТЕЛЬНО
            s=sc.next(); //считывание строчки red,cin

            int kmin = s.length() / 2 + 1;
            for (int i = 0; i < 26; i++) {
                int lmax = 0,num=-1,l;
                for (int j = 0; j < s.length(); j++) {
                    if (s.charAt(j) == 'a' + i) {
                        l = j - num;
                        lmax = max(l, lmax);
                        num = j;
                    }
                }
                l = s.length() - num;
                lmax = max(l, lmax);
                kmin = min(kmin, lmax);
            }
            System.out.println(kmin); //вывод write,cout
         }
}
