#include "bits/stdc++.h"
#include<unordered_map>
#pragma warning(disable:4996)
using namespace std;



int main() {
  int N; cin >> N;
  vector<int>as;
  for (int i = 0; i < N-1; ++i) {
    int a; cin >> a;
    as.push_back(a);
  }

  //奇数　表か　表の個数
  int dp[2][2][10001];
  for (int i = 0; i < 2; ++i) {
    for (int j = 0; j < 2; ++j) {
      for (int k = 0; k < 10000; ++k) {
        dp[i][j][k] = 99999;
      }
    }
  }
  dp[0][1][1] =0;

  for (int i = 0; i < N-1; ++i) {
    int from = i % 2;
    int to = !from;
    for (int j = 0; j < 2; ++j) {
      for (int k = 0; k < 10000; ++k) {
        dp[to][j][k] = 99999;
      }
    }
    for (int omote = 0; omote < 2; ++omote) {
      for (int k = 0; k < 10000; ++k) {
        if (omote) {
          dp[to][omote][k + 1] = min(dp[to][omote][k + 1], dp[from][omote][k]);
          dp[to][!omote][k] = min(dp[to][!omote][k], dp[from][omote][k] + as[i]);
        }
        else {
          dp[to][omote][k] = min(dp[to][omote][k], dp[from][omote][k]);
          dp[to][!omote][k + 1] = min(dp[to][!omote][k+1], dp[from][omote][k] + as[i]);
        }
      }
    }
  }
  int ans = min(dp[1][1][N/2],dp[1][0][N / 2]);
  cout << ans << endl;
  return 0;
}