#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define int long long
#define F first
#define S second
#define pb push_back
int n,a[1000005],ans[1000005];
vector<int> v[1000005];
int mn,cnt[2000005];
signed main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    cin>>n;
    //n=300000;
    int sum=0;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        //a[i]=i+1;
        sum+=a[i];
    }
    mn=a[0];
    for(int i=0;i<n;i++)
    {
        int now=a[i];
        while(now<=a[n-1])
        {
            int l=0,r=n-1;
            while(l<r)
            {
                int mid=(l+r)>>1;
                if(a[mid]>=now) r=mid;
                else l=mid+1;
            }
            v[l].pb(i);
            now+=a[i];
        }

    }
    //return 0;
    for(int i=0;i<n;i++)
    {
        //cout<<i<<endl;
        for(int j=0;j<v[i].size();j++)
        {
            //cout<<v[i][j]<<endl;
            if(ans[v[i][j]]<1e17&&v[i][j]!=i)
            {
                cnt[ans[v[i][j]]]--;
                ans[v[i][j]]+=a[v[i][j]];
                cnt[ans[v[i][j]]]++;
                while(cnt[mn]==0) mn++;
            }
        }
        //cout<<"rkv"<<endl;
        if(i!=0) ans[i]=mn;
        ans[i]+=a[i];
        cnt[ans[i]]++;
        //cout<<ans[i]<<endl;

    }
    cout<<sum-ans[n-1]+a[n-1]<<'\n';








}