#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    long N;
    cin >> N;
    
    vector<long> A;
    for (int i=0; i<N; i++) {
        cin >> A[i];
    }
    
    long sum;
    long min_sum=0;
    for (long i=0; i<N-2; i++) {
        for (long j=i+1; j<N-1; j++) {
            for (long k=j+1; k<N; k++) {
                sum=0;
                if ((A[i]<A[j] && A[j]>A[k]) || (A[i]>A[j] && A[j]<A[k])) {
                    sum += A[i]+A[j]+A[k];
                    min_sum = min(min_sum, sum);
                }
            }
        }
    }
    
    cout << min_sum << endl;
    return 0;
}