#include <bits/stdc++.h>
const int N = 5e5 + 5;
std::vector<int64_t> pref(N);
int64_t sum(int l, int r) {
if(l > r) {
return 0;
}
return pref[r] - pref[l - 1];
}
int main() {
int n;
std::cin >> n;
std::vector<int64_t> a(n + 1);
for(int i = 1; i <= n; i++) {
std::cin >> a[i];
}
for(int i = 1; i <= n; i++) {
pref[i] = pref[i - 1] + a[i];
}
int64_t ans = 0;
for(int i = 1; i <= n; i++) {
int64_t mn = 1e18;
int k = (n + 1) / 2;
for(int j = i; j >= std::max(1, i - k + 1); j--) {
mn = std::min(mn, sum(j, i) + sum(i + 1, k + j - 1));
}
for(int j = i; j <= std::min(n, i + k - 1); j++) {
mn = std::min(mn, sum(i, j) + sum(j + 1 - k, i - 1));
}
if(k >= i) {
for(int j = i; j <= std::min(n, i + k - 2); j++) {
mn = std::min(mn, sum(1, i) + sum(i, j) + sum(j + n - k + 1, n));
}
}
if(k >= n - i + 1) {
for(int j = i; j >= std::max(1, i - k + 2); j--) {
mn = std::min(mn, sum(j, i) + sum(i + 1, n) + sum(1, k - n + j - 1));
}
}
ans = std::max(ans, mn);
}
std::cout << ans;
}
