#include <cstdio>
#include <algorithm>
using namespace std;

int n;
int t[10002];

int dp[2][5001][2];

int main(void){
  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 < 5001; j++){
      for(int k = 0; k < 2; k++){
	dp[i][j][k] = 1<< 25;
      }
    }
  }

  dp[1][0][0]=0;

  for(int i = n; i > 0; i--){
    for(int j = 0; j < 5000; j++){
      dp[i%2][j+1][0] = min(dp[(i+1)%2][j][0],dp[(i+1)%2][j][1]+t[i]);
      dp[i%2][j][1] = min(dp[(i+1)%2][j][1],dp[(i+1)%2][j][0]+t[i]);
      dp[(i+1)%2][j][0] = 1 << 25;
      dp[(i+1)%2][j][1] = 1 << 25;
    }
  }
  printf("%d\n",dp[1][n/2][0]);
}