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.*;
import java.util.*;
public class A911
{
 public static void main(String args[])
 {
  Scanner I=new Scanner(System.in);
  int n;
  n=I.nextInt();
  int a[]=new int[n];
  int i;
  for(i=0;i<n;i++)
  a[i]=I.nextInt();
  int l=a[0];
  for(i=0;i<n;i++)
  {
   if(a[i]<=l)
   l=a[i];
  }
  int c=0;
  for(i=0;i<n;i++)
  {
   if(a[i]==l)
   c++;
  }
  int j=0;
  int b[]=new int[c];
  for(i=0;i<n;i++)
  {
   if(a[i]==l)
   {
    b[j]=i;
    j++;
   }
  }
  int le=b[1]-b[0];
  for(i=1;i<c-1;i++)
  {
   if((b[i+1]-b[i])<le)
   le=b[i+1]-b[i];
  }
  System.out.println(le);
 }
}