#include <bits/stdc++.h>

using namespace std;

#define int long long
#define ll long long
#define forn(i, n) for (ll i = 0; i < n; ++i)
#define forr(i, s, n) for (ll i = s; i < n; ++i)
#define fori(i, s, n) for (ll i = s; i > n; --i)
#define fora(i, n) for (auto i: n)
#define vi vector<int>
#define vll vector<ll>

const int MOD = 998244353;
// const int MOD = 1e9 + 7;

void solve() {
    int n;
    cin >> n;
    vi vec(n);
    forn(i, n) cin >> vec[i];
    int ANS = LLONG_MAX;
    int sum = 0;

    for (int P = 0; P < min(n, 100LL); P++) {
        int l = 1, r = 1e12;
        int ans = -1;
        
        while (l <= r) {
            int mid = (l + r) / 2;
            int cur = mid;

            int p = 0;
            bool fi = 1;
            bool fin = 0;
            for (int i = vec.size()-1; i >= 0; i--) {
                if (p + vec[i] <= cur) {
                    p += vec[i];
                } else {
                    cur = p;

                    if (cur < vec[i]) {
                        fin = 0;
                        break;
                    }
                    p = vec[i];
                }
                if (!i) fin = 1;
            }

            // cout << mid << ' ' << fin << '\n';
            if (fin) {
                ans = mid;
                r = mid - 1;
            }
            else {
                l = mid + 1;
            }
        }


        ANS = min(ANS, max(ans, sum));

        if (ans < sum) break;
        sum += vec.back();
        vec.pop_back();

    }


    cout << ANS << '\n';
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    // cin >> t;
    while (t--) solve();

    return 0;
}