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
def check(s, K):
	for ch in range(0, 26): 
		c = chr(97 + ch) 
		last = -1
		found = True
		for i in range(0, K): 
			if s[i] == c: 
				last = i 
		if last == -1: 
			continue
		for i in range(K, len(s)): 
			if s[i] == c: 
				last = i 
			if last <= (i - K): 
				found = False
				break

		if found: 
			return 1
	
	return 0

def binarySearch(s): 

	low, high, ans = 1, len(s), None
	
	while low <= high: 
		mid = (high + low) >> 1
		if check(s, mid): 
			ans, high = mid, mid - 1
		else: 
			low = mid + 1
	
	return ans 

s = input()
print(binarySearch(s)) 

