#include <bits/stdc++.h>
using namespace std;

long long n,zly,minimum,kwadrat,L,P,S,b,wynik;
long long t[510000],suma;

int main()
{
    cin>>n;

    for(int i = 1; i <= n; i++)
    {
        cin>>t[i];
        minimum = max(minimum,t[i]);
    }
    zly = max(n,minimum);
    L = minimum;
    P = zly;

    for(int i = 1; i <= zly - minimum; i++)
    {
        kwadrat = 1;
        S = (L+P) / 2;
        b = S;
        for(int j = 1; j <= n; j++)
        {
            if(t[j] > b)
            {
                kwadrat++;
                b = S - t[j];
            }
            else b -= t[j];
            //cout<<t[j]<<" "<<b<<" "<<kwadrat<<endl;
        }
        //cout<<kwadrat<<endl;
        if(kwadrat > S) L = S+1;
        else if(kwadrat < S) P = S-1;
        else { cout<<S; return 0; }
    }
}