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

public class C888 {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        char[] S = in.next().toCharArray();
        int[] maxDist = new int[26];
        int[] last = new int[26];
        Arrays.fill(last, -1);
        for (int i=0; i<S.length; i++) {
            int idx = S[i]-'a';
            int dist = i - last[idx];
            maxDist[idx] = Math.max(maxDist[idx], dist);
            last[idx] = i;
        }
        for (int idx=0; idx<26; idx++) {
            int dist = S.length - last[idx];
            maxDist[idx] = Math.max(maxDist[idx], dist);            
        }
        int min = S.length;
        for (int dist : maxDist) {
            min = Math.min(min, dist);
        }
        System.out.println(min);
    }

}
