#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define fs first
#define sc second
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, ll> pll;
typedef priority_queue <ll, vector<ll>, greater<ll>> pqmin;
const double EPS = 1e-16;
const int INF = 2e9;
const int MOD = 1e9+7;

const int p=1e5+5;
int a[p];

struct SegtreeLazy {
    int n;
    int defval;
    vector<int>t;
    vector<int>lazy;
    vector<int>a;

    SegtreeLazy(int n,int defval) : n(n),defval(defval) {
        a.resize(n+5);
        t.resize(4*n+5);
        lazy.assign(4*n+5,0);
    }

    int merge(int x, int y) {
        return max(x, y);
    }

    void build(int v, int s, int e) {
        if (s == e) {
            t[v] = a[s];
            return;
        }
        int mid = (s + e) / 2;
        build(v * 2, s, mid);
        build(v * 2 + 1, mid + 1, e);
        t[v] = merge(t[v * 2], t[v * 2 + 1]);
    }

    void push(int v, int s, int e) {
        if (lazy[v] == 0 || s == e) return;
        t[v * 2] = merge(t[v*2],lazy[v]);
        lazy[v * 2] = merge(lazy[v * 2],lazy[v]);
        t[v * 2 + 1] = merge(t[v * 2 + 1],lazy[v]);
        lazy[v * 2 + 1] = merge(lazy[v * 2 + 1],lazy[v]);
        lazy[v] = 0;
    }

    void update(int v, int s, int e, int l, int r, int val) {
        if (l > r) return;
        if (s == l && e == r) {
            lazy[v] = merge(lazy[v],val);
            t[v] = merge(t[v],val);
            return;
        }
        push(v, s, e);
        int mid = (s + e) / 2;
        update(v * 2, s, mid, l, min(r, mid), val);
        update(v * 2 + 1, mid + 1, e, max(l, mid + 1), r, val);
        t[v] = merge(t[v * 2], t[v * 2 + 1]);
    }

    int get(int v, int s, int e, int l, int r) {
        if (l > r) return defval;
        if (l <= s && e <= r) return t[v];
        push(v, s, e);
        int mid = (s + e) / 2;
        int p1 = get(v * 2, s, mid, l, min(r, mid));
        int p2 = get(v * 2 + 1, mid + 1, e, max(l, mid + 1), r);
        return merge(p1, p2);
    }
};

void solve(){
    int n;
    cin>>n;
    vector<int>pref(n+1,0);
    for(int i=1;i<=n;i++){
        cin>>a[i];
        pref[i]=pref[i-1]+a[i];
    }
    SegtreeLazy sgtree=SegtreeLazy(n+1,0);
    for(int i=1;i<=n+1;i++){
        sgtree.a[i]=1;
    }
    int ans=INF;
    sgtree.build(1,1,n+1);
    for(int i=2;i<=n;i++){
        int previdx=sgtree.get(1,1,n+1,i,i);
        int sum=pref[i-1]-pref[previdx-1];
        int sumright=pref[n]-pref[i-1];
        ans=min(ans,max(sum,sumright));
        int nxtidx=lower_bound(pref.begin(),pref.end(),sum+pref[i-1])-pref.begin();
//        cout<<"! "<<i<<" "<<previdx<<" "<<sum<<" "<<sumright<<" "<<nxtidx<<" "<<ans<<endl;
        if(nxtidx==n+1)continue;
        sgtree.update(1,1,n+1,nxtidx+1,n+1,i);
    }
    int previdx=sgtree.get(1,1,n+1,n+1,n+1);
    int sum=pref[n]-pref[previdx-1];
    ans=min(ans,sum);
    cout<<ans<<endl;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t=1;

    while(t--){
        solve();
    }

    cin.get();
    return 0;
}