#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz size()
using namespace std;
const double pi = 2 * acos(0.0);
const ll N=1e6+7, M=998244353;
ll a[N], pr[N];
void solve()
{
int n;
cin >> n;
for (int i=0;i<n;i++) {
cin >> a[i];
pr[i]=pr[max(0, i-1)]+a[i];
}
ll ans=0;
for (int i=0;i<n;i++){
int res=(n+1)/2;
ll mn=1e18;
for (int j=0;j<res;j++){
int l=(i-1+n) % n;
ll sum=0;
for (int pos=0;pos<j;pos++){
sum+=a[l];
l=(l-1+n) % n;
}
l=i;
for (int pos=0;pos<res-j;pos++){
sum+=a[l];
l++;
}
mn=min(mn, sum);
}
ans=max(ans, mn);
}
cout << ans;
return ;
}
int main(){
ios;
int t=1;
// cin >> t;
while (t--){
solve();
cout << "\n";
}
return 0;
}
