#include<bits/stdc++.h>

#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;

int n;
vector<int> a;
vector<int> p{0};

void ReadInput()
{
    cin >> n;
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        a.push_back(x);
        p.push_back(p.back() + x);
    }
}

int wrap(int start) {
    int cur = p[start];
    int cur_idx = start;

    while (1) {
        auto it = lower_bound(p.begin(), p.end(), p[cur_idx] + cur);

        if (it == p.end())
            break;

        int jump = it - p.begin();
        cur = max(cur, p[jump] - p[cur_idx]);
        cur_idx = jump;
    }

    return cur;
}

void Solve()
{
    int ans = oo;

    for (int i = 1; i < n; i++) {
        int w = wrap(i);
        ans = min(ans, w);
    }

    cout << ans << endl;
}
#define taskname ""
int32_t main()
{
    if (fopen(taskname ".inp", "r"))
    {
        freopen(taskname ".inp", "r", stdin);
        freopen(taskname ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    //cin >> T;
    for(int itest=1; itest<=T; itest++)
    {
        ReadInput();
        Solve();
    }
}