#include"bits/stdc++.h"
#define _det(...) fprintf(stderr,__VA_ARGS__)
#define Print(a) cerr<<a<<"\n"
#define IOS ios::sync_with_stdio(0);cin.tie(0)
#define Cases int T;cin>>T;while(T--)
#define Debug(in) cerr<<#in<<" = "<<(in)<<"\n"
#define Watch(in) Detect;Debug(in);
#define Detect _det("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define ll long long
using namespace std;

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

ll runs (int pos) {
    int l = pos, r = pos;
    ll sum = 0, res = 0;
    while (r - l + 1 < n) {
        if (res > ans) {
            res = INF;
            break;
        }
        if (a[l] < a[r]) {
            if (sum < a[l]) {
                pas[l] = true;
                res += a[l] - sum;
            }
            sum += a[l--];
        }
        else {
            if (sum < a[r]) {
                pas[r] = true;
                res += a[r] - sum;
            }
            sum += a[r++];            
        }
    }
    //Debug(res);
    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);
    for (int i = 1;i <= n+n;i++) {
        if (pas[ord[i].second]) continue;
       ans = min(ans, runs(ord[i].second)); 
    }
    cout << ans << endl;
}