include<bits/stdc++.h>

using namespace std;

int main(){
int n; cin >> n;
int a[100000];
for(int i = 0; i < n; i++){
cin >> a[i];
}
int minvl = *max_element(a, a + n);
int maxvl = *min_element(a, a + n);
vector<int>dp;
for(int i = 0; i < n; i++){
if(a[i] == minvl || a[i] == maxvl){
dp.push_back(i);
}
}
int minn = INT_MAX;
for(int i = 1; i < dp.size(); i++){
int rs = dp[i] - dp[i - 1] + 1;
if(minn > rs) minn = rs;
}
cout << minn;
// 1 0 0 0 5 6 0 8
}