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
# -*- coding: utf-8 -*-
"""
Created on Mon Dec 11 01:57:07 2017

@author: Sand Boa
"""
s=float('inf')
a=input()
for i in list(set(a)):
    leng=max(list(map(len,a.split(i))))
    if leng<s:
        s=leng
    
print(s+1)
    
