#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vll vector<ll>
#define FOR(i,n) for(int i=0;i<n;i++)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second

const int MOD = (int)1e9+7;

int n;
const int N = 1e5+1;
int A[N];
int dp[N];
int solve(int i){
    if(i>=n) return 0;
    if(dp[i]!=-1) return dp[i];
    //ingore the fold
    int ans = solve(i+1);
    int j = i;
    ll curr = 0;
    while(j<n && curr<A[i]){
        j++;
        curr+=A[j];
    }
    if(j==n-1) j++;
    //cout<<i<<" "<<j<<endl;
    ans = max(ans,solve(j)+A[i]);
    return ans;
}
int main()
{
    cin>>n;
    ll tot = 0;
    FOR(i,n){
        cin>>A[i];
        tot+=A[i];
    }
    memset(dp,-1,sizeof(dp));
    tot-=solve(0);
    cout<<tot<<endl;
    return 0;
}