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.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

 public class NearestMinumum
 {
	 public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int num=sc.nextInt();
		ArrayList<Integer> list=new ArrayList();
		for(int i=0;i<num;i++)
		{
			list.add(sc.nextInt());
		}
		boolean flag=false;
		int distance=0,mindist=0;
		int min=list.get(list.indexOf(Collections.min(list)));
		 for(int i=0;i<num;i++)
		 {
			 if(list.get(i)==min&&flag==false)
			 {
				 flag=true;
				 distance=0;
				 continue;
			 }
			 ++distance;
			 if(list.get(i)==min && flag==true)
			 {
				 if(mindist==0||mindist>distance)
					 mindist=distance;
				  
					 
				distance=0;
			 }
		 }
		 System.out.println(mindist);
	}
 }