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.
The first line contains string *s* consisting of lowercase Latin letters (1 ≤ |*s*| ≤ 100000).
none
abacaba
2
zzzzz
1
abcde
3
bcaccacaaabaacaabaaabcbbcbcaacacbcbaaaacccacbbcbaabcbacaacbabacacacaccbbccbcbacbbbbccccabcabaaab
8
daabcdabbabbacacbaacabacbcaabaacac
4
abghim
4
gfliflgfhhdkceacdljgkegmdlhcgkcmlelmbbbmdddgdeeljjhgbbffmemmmkhebgkhadkdajabcjkcgbkgbaeacdedlkklfech
17
a
1
aaabbb
4
ab
2
abbb
2
ob
2
abccba
3
saaaaaaaas
2
axxx
2
abcba
2
abb
2
abcdea
4
axcbb
3
tmivvdcbbfrfogjviirrximhttoskopwrcmkcborcxvr
13
dlchmmuateksgldkckljrovmeuniobjrelqjpnjljlvhpqrjsfklliqpufplgaelevmlcnodbllquubobecem
15
zx
2
zxz
2
bbhdgaefbhf
6
xx
1
zxx
2
cbcada
4
z
1
aab
2
jficc
3
cceeaabfba
5
jk
2
lzeznbwu
5
rr
1

#include <stdio.h>
#include <string.h>
#include <math.h>

unsigned int CharToIndex(char c)
{
	return unsigned int(c - 97);
}

int main()
{
	char String[100000];
	scanf("%s", &String);
	int length = strlen(String);
	int LastOccurence[26];
	int MinDistance[26];

	for (int i = 0; i < 26; i++)
	{
		LastOccurence[i] = -1;
		MinDistance[i] = length;
	}

	for (int i = 0; i < length; i++)
	{
		int idx = CharToIndex(String[i]);
		if (LastOccurence[idx] == -1) LastOccurence[idx] = 0;
		else
		{
			int distance = i - LastOccurence[idx];
			LastOccurence[idx] = i;
			if (MinDistance[idx] > distance)
			{
				MinDistance[idx] = distance;
			}
		}
	}
	int min = length;
	for (int i = 0; i < 26; i++)
	{
		if (MinDistance[i] < min)
			min = MinDistance[i];
	}
	if (min == length)
		printf("%d\n", (int)ceil((double)min / 2.0));
	else
		printf("%d\n", min);

    return 0;
}

