#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int INF = 1<<29;
int N;
int t[10005];
int dp[2][2][5005];

int main(){
  scanf("%d", &N);
  for(int i=1;i<N;i++) scanf("%d",&t[i]);
  for(int i=0;i<2;i++) for(int j=0;j<2;j++) for(int k=0;k<5005;k++) dp[i][j][k] = INF;
  dp[0][0][0]= 0;
  int cur=0, tar=1;
  for(int i=0;i<N;i++){
    cur = i&1, tar = (i+1)&1;
    //    printf("%d %d\n", tar, cur);
    for(int k=0;k<=min(i,N/2);k++){
      dp[tar][0][k+1] = min(dp[cur][0][k], dp[cur][1][k] + t[i]);
      dp[tar][1][k] = min(dp[cur][1][k], dp[cur][0][k] + t[i]);
    }
    dp[tar][0][0] = INF;
  }

  printf("%d\n", min(dp[tar][0][N/2], dp[tar][1][N/2]));
  return 0;
}