#include <bits/stdc++.h>
 
//#include <unistd.h>
//#include <iostream>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
//#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'


signed main() {
	int n;
	cin >> n;
	n -= 2;
	vl a(n);
	ll sum = 0;
	cin >> sum;
	rep (i, n) {
		cin >> a[i];
	}
	ll temp;
	cin >> temp;
	sum += temp;
	if (n == 0) {
		cout << sum << endl;
		return 0;
	}

	vector<vector<vector<pll>>> dp(n, vector<vector<pll>>(n + 1));
	rep (i, n) {
		dp[i][i + 1].push_back(pll(a[i], a[i]));
	}
	for (int len = 2; len <= n; len++) {
		rep (l, n) {
			int r = l + len;
			if (r > n) break;
			for (int i = l; i < r; i++) {
				ll left, right;
				if (i == l) {
					for (pll lr: dp[l + 1][r]) {
						ll x = a[i] + lr.first;
						left = 0; right = lr.second;
						left += x; right += x;
						dp[l][r].push_back(pll(left, right));
					}
				}
				else if (i == r - 1) {
					for (pll lr: dp[l][r - 1]) {
						ll x = a[i] + lr.second;
						left = lr.first; right = 0;
						left += x; right += x;
						dp[l][r].push_back(pll(left, right));
					}
				}
				else {
					for (pll lr1: dp[l][i]) {
						for (pll lr2: dp[i + 1][r]) {
							left = lr1.first; right = lr2.second;
							ll x = a[i] + lr1.second + lr2.first;
							left += x; right += x;
							dp[l][r].push_back(pll(left, right));
						}
					}
				}
			}
			sort(all(dp[l][r]));
			vector<pll> temp;
			for (pll lr: dp[l][r]) {
				if (temp.size() == 0) temp.push_back(lr);
				else {
					if (temp.back().second <= lr.second) continue;
					else temp.push_back(lr);
				}
			}
			//DEBUG(pll(l, r));
			//DEBUG_VEC(temp);
			swap(dp[l][r], temp);
		}
	}

	ll mi = INF;
	rep (i, dp[0][n].size()) {
		chmin(mi, dp[0][n][i].first + dp[0][n][i].second);
	}
	cout << mi + sum << endl;
}

Measured memory_bytes: 580