/**
* author: marcus06
* created: 03-05-2026 12:15:55
**/
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
void solve() {
int N; cin >> N;
vector <int> V(2 * N);
for (int i = 0; i < N; ++i) cin >> V[i];
//hack 1
vector <int> pre(2 * N + 1);
for (int i = 0; i < 2 * N; ++i) {
pre[i + 1] = pre[i] + V[i];
}
int len = (N + 1) / 2;
int ans = int(1e9);
for (int r = N + 1; r <= 2 * N; ++r) {
if (r - len < N + 1) {
ans = min(ans, pre[r] - pre[r - len]);
}
}
cout << ans << '\n';
}
int main() {
std::cin.tie(0)->sync_with_stdio(0);
#ifdef LOCAL
auto begin = std::chrono::high_resolution_clock::now();
#endif
int tt = 1;
while (tt--) {
solve();
}
#ifdef LOCAL
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
std::cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
#endif
return 0;
}
