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

vector <int> memo;
vector <int> pref;

int dp(int target) {
  if (memo[target] != -1) return memo[target];
  if (memo[target] == 1) return pref[target];

  int l = 1, r = target - 1;
  int res = pref[target];

  while (l <= r) {
    int mid = (l + r) / 2;
    if (dp(mid) <= pref[target] - pref[mid]) {
      res = pref[target] - pref[mid];
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }

  return memo[target] = res;
}

int32_t main() {
  int n;
  cin >> n;

  pref.resize(n + 1, 0);
  memo.resize(n + 1, -1);

  for (int i = 1; i <= n; i++) {
    cin >> pref[i];
    pref[i] += pref[i - 1];
  }

  int ans = INT_MAX;
  for (int i = 0; i <= n; i++) {
    ans = min(ans, max(dp(i), pref[n] - pref[i]));
  }

  cout << ans << '\n';
}