#include"bits/stdc++.h"
#define ll long long
using namespace std;

const int maxn = 1e6+5;
const ll INF = 5e18;
ll a[maxn];
int pas[maxn];
pair<ll,int> ord[maxn];
int n;
ll ans = INF;
int rep;

int pL, pR;

ll runs (int pos) {
    pL = 0, pR = 0;
    int l = pos - 1, r = pos + 1;
    ll sum = a[pos]+a[pos], res = a[pos];
    while (r-l-1 < n) {
        if (res >= ans) {
            res = INF;
            break;
        }
        if (a[l] < a[r]) {
            if (sum < a[l]) {
                pas[l] = true;
                if (!pL) pL = l;
                res += a[l] - sum;
                sum = a[l];
            }
            sum += a[l--];
        }
        else {
            if (sum < a[r]) {
                pas[r] = true;
                if (!pR) pR = r;
                res += a[r] - sum;
                sum = a[r];
            }
            sum += a[r++];     
        }
    }
    return res;
}

int main () {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    a[0] = INF;
    a[n + n + 1] = INF;
    for (int i = 1;i <= n;i++) {
        cin >> a[i];
        a[n + i] = a[i];
        ord[i] = {a[i], i};
        ord[n + i] = {a[i], n + i};
    }
    sort(ord + 1, ord + n + 1);
    ans = runs(ord[1].second); 
    for (int i = 1;i <= n+n;i++) {
        int x = ord[i].second;
        if (pas[x]) continue;
        if (pL <= x && x <= pR) continue;
        ans = min(ans, runs(x)); 
    }
    cout << ans;
}