#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll maxl[200010];
ll maxr[200010];

int main(void){
    int n;
    cin>>n;
    vector<ll>a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    maxl[0]=0;
    for(int i=0;i<n;i++){
        maxl[i+1]=max(maxl[i],a[i]);
    }
    reverse(a.begin(),a.end());
    for(int i=0;i<n;i++){
        maxr[i+1]=max(maxr[i],a[i]);
    }
    reverse(a.begin(),a.end());
    set<ll>s1,s2;
    s1.insert(a[0]);
    for(int i=1;i<n;i++)s2.insert(a[i]);
    ll ans = (ll)INF;
    for(int i=1;i<n;i++){
        ll l = maxl[i];
        ll r = maxr[n-1-i];
        if((l>a[i])&&(a[i]<r)){
            ans = min(ans,l+r+a[i]);
        }
        s2.erase(a[i]);
        auto itr1 = s1.lower_bound(a[i]);
        auto itr2 = s2.lower_bound(a[i]);
        if(itr1==s1.begin()){
            s1.insert(a[i]);
            continue;
        }
        if(itr2==s2.begin()){
            s1.insert(a[i]);
            continue;
        }
        ans = min(ans,a[i]+*(s1.begin())+*(s2.begin()));
        s1.insert(a[i]);
    }
    if(ans == (ll)INF)cout<<-1<<endl;
    else cout<<ans<<endl;
    return 0;
}