#define _CRT_SECURE_NO_WARNINGS

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <ctime>
#include <cassert>
#include <map>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <stack>
#include <queue>
#include <numeric>
#include <iterator>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T, class S, class U, class V> void writerLn(T x, S y, U z, V v) { writer(x, ' '); writer(y, ' '); writer(z, ' '); writer(v, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
ll mod_inv(ll a, ll m) { ll x, y; extgcd<ll>(a, m, x, y); return (m + x % m) % m; }

#ifdef _MSC_VER
template <typename ... Args>
void debugPrintf(const char *format, Args const & ... args) {
	fprintf(stderr, format, args ...);
	fflush(stderr);
}
#else
#define debugPrintf(...)
#endif

const int MOD = ten(9) + 7;

vector<int> add(vector<int> a, vector<int> b) {
	FOR(i, sz(a)) a[i] += b[i];
	return a;
}

void test(int n) {
	vector<vector<int>> v;
	FOR(i, n) {
		vector<int> t(n);
		t[i] = 1;
		v.push_back(t);
	}
	deque<vector<vector<int>>> q;
	q.push_back(v);
	vector<vector<int>> anses;
	set<int> st;
	while (!q.empty()) {
		auto cur = q.front();
		q.pop_front();
		if (sz(cur) == 2) {
			auto a = add(cur[0], cur[1]);
			// writerArr(a);
			// anses.push_back(a);
			for (auto x : a) st.insert(x);
			continue;
		}
		FOR(i, sz(cur) - 2) {
			auto nt = cur;
			auto dl = nt[i + 1];
			nt.erase(nt.begin() + i + 1);
			nt[i] = add(nt[i], dl);
			nt[i + 1] = add(nt[i + 1], dl);
			q.push_back(nt);
		}
	}
	//sort(anses.begin(), anses.end());
	//anses.erase(unique(anses.begin(), anses.end()), anses.end());

	//for (auto& x : anses) {
	//	writerArr(x);
	//	for (auto c : x) st.insert(c);
	//}
	// writerArr(x);
	writerLn(sz(st));
}

ll a[20];

const int C = 620;


ll dp[16][17][C][C];
ll f(int l, int r, int lc, int rc) {

	if (l == r) return 0;
	if (r - l == 1) return a[l] * (lc + rc);
	else if (r - l == 2) {
		ll a1 = a[l] * (lc + rc) + a[l + 1] * (lc + rc + rc);
		ll a2 = a[l] * (lc + lc + rc) + a[l + 1] * (lc + rc);
		return min(a1, a2);
	} else if (r - l == 3) {
		ll ret = (a[l] + a[l + 1] + a[l + 2]) * (lc + rc);
		ll a1 = a[l + 1] * rc + a[l + 2] * 2 * rc;
		ll a2 = a[l] * lc + a[l + 2] * rc;
		ll a3 = a[l] * lc * 2 + a[l + 1] * lc;
		ll a4 = a[l] * lc + a[l + 1] * (2 * lc + rc);
		ll a5 = a[l + 2] * rc + a[l + 1] * (lc + rc * 2);
		a1 = min(a1, a2);
		a1 = min(a1, a3);
		a1 = min(a1, a4);
		a1 = min(a1, a5);
		return ret + a1;
	} else {
		ll& ret = dp[l][r][lc][rc];
		if (ret != -1) return ret;
		if (lc >= C || rc >= C) return (ll)1e18;
		ll mn = (ll)1e18;
		for (int i = l; i < r; i++) {
			ll lval = 0;
			if (i != l) {
				lval = f(l, i, lc, lc + rc);
			}
			ll rval = 0;
			if (i != r - 1) {
				rval = f(i + 1, r, lc + rc, rc);
			}
			ll cur = a[i] * (lc + rc);
			cur += lval + rval;
			if (mn > cur) mn = cur;
		}
		return ret = mn;
	}
}

int main() {
	//for (int i = 3; i < 15; i++) {
	//	printf(" ---- %d ----\n", i);
	//	test(i);
	//}

	int n; reader(n);
	int x, y; reader(x);
	FOR(i, n - 2) reader(a[i]);
	reader(y);
	memset(dp, -1, sizeof(dp));

	ll ans = f(0, n - 2, 1, 1) + x + y;
	writerLn(ans);

	return 0;
}


Measured memory_bytes: 817152