#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;
typedef tree<int, null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> TREE;
//tree.find_by_order() / tree.order_of_key();
int n, arr[100005], dp[100005], pre[100005];
set<pair<int, int>> s;
int inc = 0;
void solve(){
    cin >> n;
    for(int i=1; i<=n; ++i){
        cin >> arr[i];
        pre[i] = pre[i-1]+arr[i];
    }
    for(int i=1; i<n; ++i){
        int last_ind = inc, max_len = -1;
        while(!s.empty()){
            auto it = s.begin();
            if(it->first > pre[i]-pre[inc] || it->first>pre[i]-pre[it->second]){
                break;
            }
            if(pre[i]-pre[it->second]>=it->first){
                inc = max(inc, it->second);
                last_ind = inc;
                s.erase(it);
            }
            else{
                last_ind = it->second;
                max_len = it->first;
                break;
            }
        }
        if(max_len<0){
            max_len = pre[i]-pre[last_ind];
        }
        dp[i] = max(max_len, pre[i]-pre[last_ind]);
        s.insert({dp[i], i});
        //cout << dp[i] << '\n';
    }
    int ans = INT_MAX;
    for(int i=1; i<n; ++i){
        if(pre[n]-pre[i]<=dp[i]){
            ans = min(ans, dp[i]);
        }
    }
    cout << ans << '\n';

}
int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}