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

public class C {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String input = scanner.nextLine();
        Set<Character> alphabet = new HashSet<>();
        int result = input.length();
        for (int i = 0; i < input.length(); i++) {
            Character current = input.charAt(i);
            if (!alphabet.contains(current)) {
                alphabet.add(current);
                int maxDistance = i;
                int currentDistance = i;
                for (int j = i; j < input.length(); j++) {
                    if (input.charAt(j) == current) {
                        maxDistance = Math.max(currentDistance, maxDistance);
                        currentDistance = 0;
                    } else {
                        currentDistance++;
                    }
                    if (j == input.length() - 1) {
                        maxDistance = Math.max(currentDistance, maxDistance);
                    }
                }
                result = Math.min(result, maxDistance);
            }
        }
        System.out.println(result + 1);
    }
}