#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define ss second
#define ff first
#define piii pair<int,pii>
#define debu(x) (cerr << #x << " = "<< x << "\n")
#define debu2(x,y) (cerr << #x << " = "<< x << " " << #y << " = " << y << "\n")
#define debu3(x,y,z) (cerr << #x << " = "<< x << " " << #y << " = " << y << " " << #z << " = " << z<< "\n")
#define bitout(x,y) {\
cerr << #x << " : ";\
for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\
cout << "\n";\
}
#define rangeout(j,rangestart,rangeend) {\
cerr << "outputting" << #j<< ":\n";\
for (int forrang = rangestart; forrang <= rangeend; forrang++)cerr << j[forrang] << " ";\
cerr<<"\n";\
}
#define c1 {cerr << "Checkpoint 1! \n\n";cerr.flush();}
#define c2 {cerr << "Checkpoint 2! \n\n";cerr.flush();}
#define c3 {cerr << "Checkpoint 3! \n\n";cerr.flush();}
#define c4 {cerr << "Checkpoint 4! \n\n";cerr.flush();}
int n;
signed main()
{
int t1,t2,t3,t4;
mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
//ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
vector<int>nummys(n+1);
for(int a=1;a<=n;a++)cin>>nummys[a];
int x=n/2+n%2;
vector<int>starthere(n+1);
queue<int>myq;
myq.push(0);int curr=0;
for(int a=1;a<x;a++)
{
myq.push(nummys[a]);
curr+=nummys[a];
}
int currat=x-1;
for(int a=1;a<=n;a++)
{
curr-=myq.front();myq.pop();
currat++;if(currat>n)currat=1;
myq.push(nummys[currat]);curr+=nummys[currat];
starthere[a]=curr;
}
priority_queue<pii,vector<pii>,greater<pii>>pq;
for(int a=1;a<=n;a++){pq.push(mp(starthere[a],a));}
//c1;
while(pq.top().ss>1&&pq.top().ss<(n-(x-1)+1))
{
//debu(pq.top().ss);
pq.pop();
}
//c1;
cout<<pq.top().ff;
}
//minimum range that contains me
