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 Codeforces {        
    public static void main(String[] args) {
        TaskA Solver = new TaskA();
        Solver.Solve();                
    }    
    public static class TaskA {           
        public void Solve() {
            Scanner in = new Scanner(System.in);                           
            ArrayList <Element> ar = new ArrayList<>();
            int n = in.nextInt();
            for (int i = 0; i < n; i++) 
                ar.add(new Element(in.nextInt(), i));            
            Collections.sort(ar);
            int minval = ar.get(0).val;
            int min = 1000000, i = 1, l = ar.size(), lastindx = ar.get(0).indx;
            while (i < l) {
                if (ar.get(i).val != minval)
                    break;
                else {
                    int nmin = ar.get(i).indx - lastindx;
                    if (nmin < min)
                        min = nmin;
                    lastindx = ar.get(i).indx;
                }  
                i++;
            }
            System.out.println(min);
        }
        private class Element implements Comparable<Element> {
            private int val, indx;
            public Element(int v, int i) {
                val = v;
                indx = i;
            }
            @Override
            public int compareTo(Element o) {     
                if (val != o.val)
                    return Integer.compare(val, o.val);
                else
                    return Integer.compare(indx, o.indx);
            }            
        }
    }
}