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 NearestMinimum
{
  public static void main(String args[])
  {
    Scanner input = new Scanner(System.in);
    int n = input.nextInt();
    int arr[] = new int[n];
    for(int i=0;i<n;i++)
    {
      arr[i] = input.nextInt();
    }
    int min=arr[0];
    for(int i=1;i<n;i++)
    {
      if(arr[i]<min)
      {
        min=arr[i];
      }
    }
    //System.out.println(min);
    int start =-1;
    int end = -1;
    int diff = n;
    for(int i=0;i<n;i++)
    {
      if(arr[i] == min && start !=-1)
      {
        end = i;
        if(end - start < diff)
        {
          diff = end - start;
          //System.out.println(diff);
        }
        start =i;
      }
      if(arr[i] == min && start == -1)
      {
        start = i;
      }


    }
    System.out.println(diff);
  }
}
