You are given an array of n integer numbers a0, a1, ..., an - 1. Find the distance between two closest (nearest) minimums in it. It is guaranteed that in the array a minimum occurs at least two times.

Input

The first line contains positive integer n (2 ≤ n ≤ 105) — size of the given array. The second line contains n integers a0, a1, ..., an - 1 (1 ≤ ai ≤ 109) — elements of the array. It is guaranteed that in the array a minimum occurs at least two times.

Output

Print the only number — distance between two nearest minimums in the array.

Examples

Input

2
3 3


Output

1


Input

3
5 6 5


Output

2


Input

9
2 1 3 5 4 1 2 3 1


Output

3

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	int n;
    char[] python;
    int[][] dp;
    
	void solve()
	{
        int n=ni();
        int[] ar=new int[n];
        int min=Integer.MAX_VALUE;
        for(int i=0;i<n;i++)
        {
            ar[i]=ni();
            if(ar[i]<min){min=ar[i];}
        }
        int hist=-1;
        int min_ans=Integer.MAX_VALUE;
        for(int i=0;i<n;i++)
        {
            if(ar[i]==min)//its min
            {
                if(hist==-1)//first time occ
                {
                    hist=i;
                }
                else
                {
                    int dif=i-hist;
                    if(dif<min_ans)
                    {
                        min_ans=dif;
                    }
                    hist=i;
                }
            }
            
            
            
        }
       out.println(min_ans);
	}
    int ways(char hist,int index,int[] elev)//current index
    {
        //out.println(hist+" "+index);
        //for(int i=0;i<index;i++){out.print(elev[i]+" ");}
        //out.println();
        
        if(hist=='f')//we need to change elev
        {
            if(index==n-1)//end case
            {
                
                return 1;
            }
            else//normal
            {
                
                    elev[index]=elev[index-1]+1;
                
                
                hist=python[index];
                
                
                
                if(dp[elev[index]][index]==0)
                {
                    dp[elev[index]][index]=ways(hist,index+1,elev);
                }
                return dp[elev[index]][index];
            }
        }
        else//hist is s
        {
            if(index==n-1)//works
            {
                elev[index]=elev[index-1];
                if(dp[elev[index]][index]==0)
                {
                    dp[elev[index]][index]=elev[index-1];
                }
                return dp[elev[index]][index];
               
                
            }
            else
            {
                
                if(index!=0)//not first ele
                {
                    int answer=0;
                    int no=elev[index-1];
                    hist=python[index];
                    
                    for(int i=1;i<=no;i++)
                    {
                        
                        elev[index]=i;
                        if(dp[elev[index]][index]==0)
                        {
                        dp[elev[index]][index]=ways(hist,index+1,elev);
                        }
                        answer+=dp[elev[index]][index];
                    }
                     return answer;
                }
                else
                {
                    hist=python[0];
                    
                    if(dp[elev[index]][index]==0)
                        {
                        
                        dp[elev[index]][index]=ways(hist,index+1,elev);
                        }
                    return dp[elev[index]][index];
                }
               
            }
            
        }
        
    }
    
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new B().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}