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.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.*;
import java.math.*;

import org.omg.CORBA.Any;


public class template {

	public static void main(String[] args) throws IOException {
		Reader scn=new Reader();
		String s=scn.readLine();
		
		int lo=1, hi=s.length();
		int ans=s.length();
		while(lo<=hi){
			 int mid=(lo+hi)/2;
			 
			 if(f(s,mid)){
				 hi=mid-1;
				 ans=mid;
			 }
			 
			 else
				 lo=mid+1;
		}
		
		System.out.println(ans);
	}
	   
	private static boolean f(String s, int length) {
	
   for(char ch='a'; ch<='z'; ch++){
		int cnt=0;
		
		int max=1;
		for(int i=0; i<s.length(); i++){
			 if(i<length){
				 if(s.charAt(i)==ch)
					 cnt++;
			 }
			 
			 else{
				 max=Math.min(max, cnt);
				      if(s.charAt(i)==ch)
				    	  cnt++;
				      if(s.charAt(i-length)==ch)
				    	  cnt--;
			 }
			 
			 
		}
		if( max>=1)
			 return true;
      }
    
     return false;
	}





	// _________________________TEMPLATE_____________________________________________________________

	








	







//	private static class pair implements Comparable<pair> {
//		int min;
//		int aven;
//
//		pair(int l, int b) {
//			min = l;
//			aven= b;
//		}

//		@Override
//		public int compareTo(pair o) {
//			
//			 if(this.p==o.p)
//				 return this.t-o.t;
//			 else
//				 return o.p-this.p;
//		}
//
//		public String toString() {
//			return p + "-" + t;
//		}
//	}

	





	public static void printarray(long[] dp1) {
		for (long i : dp1)
			System.out.print(i + " ");
		System.out.println();
	}
	
	public static void inputarray(long []a, int n,Reader scn) throws IOException{
		for(int i=0; i<n; i++)
			a[i]=scn.nextLong();
	}

	private static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public String readLine() throws IOException {
			byte[] buf = new byte[100000 + 1]; // line length
			int cnt = 0, c;
			while ((c = read()) != -1) {
				if (c == '\n')
					break;
				buf[cnt++] = (byte) c;
			}
			return new String(buf, 0, cnt);
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();

			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (c == '.') {
				while ((c = read()) >= '0' && c <= '9') {
					ret += (c - '0') / (div *= 10);
				}
			}

			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}

}
