#include <iostream>
#include <fstream>
#include <unordered_set>

using namespace std;

ofstream fout("secv.out");

unordered_set <int> f;

const int N = 5000, inf = 1e18 + 1;
int v[N + 1], dp[N + 1], start[N + 1];

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

int main(){
    InParser fin("secv.in");
    int n, mini = inf, distincte = 0;
    fin >> n;
    for(int i = 1; i <= n; i++){
        fin >> v[i], mini = min(mini, v[i]);
        if(f.find(v[i]) == f.end()) distincte++, f.insert(v[i]);
    }
    for(int i = 1; i <= n; i++)
        if(v[i] == mini)
            dp[i] = 1, start[i] = i;
    for(int i = 1; i <= n; i++){
        if(v[i] != mini){
            int maxi = -1, jchoice = -1;
            for(int j = i - 1; j >= 1; j--)
                if(v[j] < v[i] && dp[j] > maxi && start[j])
                    maxi = dp[j], jchoice = j;
            if(jchoice != -1) dp[i] = dp[jchoice] + 1, start[i] = start[jchoice];
        }
    }
    int ans = inf;
    for(int i = 1; i <= n; i++)
        if(dp[i] == distincte)
            ans = min(ans, i - start[i] + 1);
    fout << ans;
    return 0;
}