#include<bits/stdc++.h>
#define ll long long int
#define pii pair<int, int>
#define vll vector<ll>

using namespace std;

map<pii, ll> dp;

int recur(vll values, int i, int j){
    // base case
    int n = (int)values.size();
    if(i== (n-1))
        return 0;
    
    if(dp.find({i,j}) != dp.end()){
        return dp[{i,j}];
    }
    int a = INT_MAX;
    int b = a;
    if(i>0 && (i-j+1)>=0)
        a = values[i-j + 1] + recur(values, i-j+1, j);
    if(i+j < n)
        b = values[i+j] + recur(values, i+j, j+1);
    return dp[{i,j}] = min(a, b);
}
int main(){
	ll i, j, n;
	cin>>n;
	vll arr(n, 0);
	for(i=0;i<n;i++){
		cin>>arr[i];
	}
	cout<< recur(arr, 0, 1)<<endl;
	return 0;
}