//start of jonathanirvings' template v3.0.3 (BETA)

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};

#ifdef TESTING
  #define DEBUG fprintf(stderr,"====TESTING====\n")
  #define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
  #define debug(...) fprintf(stderr, __VA_ARGS__)
#else
  #define DEBUG 
  #define VALUE(x)
  #define debug(...)
#endif

#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define REP(i,n) FOR(i,0,n)
#define REPN(i,n) FORN(i,1,n)
#define MAX(a,b) a = max(a,b)
#define MIN(a,b) a = min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define RESET(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)

inline string IntToString(LL a){
  char x[100];
  sprintf(x,"%lld",a); string s = x;
  return s;
}

inline LL StringToInt(string a){
  char x[100]; LL res;
  strcpy(x,a.c_str()); sscanf(x,"%lld",&res);
  return res;
}

inline string GetString(void){
  char x[1000005];
  scanf("%s",x); string s = x;
  return s;
}

inline string uppercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}

inline string lowercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}

inline void OPEN (string s) {
  #ifndef TESTING
  freopen ((s + ".in").c_str (), "r", stdin);
  freopen ((s + ".out").c_str (), "w", stdout);
  #endif
}

//end of jonathanirvings' template v3.0.3 (BETA)

// int f(int n)
// {
//   vector<LL> data(n,1);
//   FORN(i,1,n-2)
//   {
//     data[0] += data[1];
//     data[2] += data[1];
//     data.erase(data.begin() + 1);
//   }
//   return data[0] + data[1];
// }

// set<vector<LL>> visited;

// void f(vector<LL> v)
// {
//   if (v)
// }

// LL dp[25][25][2][305][305];
map<pii,LL> dp[25][25];
int n;
LL data[25];

LL jahja(int L, int R, int le, int ri)
{
  if (L == R) return ((le + ri) * (LL)data[L]);
  if (L > R) return 0;
  if (dp[L][R].count(mp(le,ri))) return dp[L][R][mp(le,ri)];
  LL &ret = dp[L][R][mp(le,ri)];
  // LL &ret = dp[L][R][side][now][prev];
  // if (ret >= 0) return ret;
  ret = INFF;
  FORN(i,L,R)
  {
    LL now2 = data[i] * (le + ri);
    now2 += jahja(L,i-1,le,le+ri);
    now2 += jahja(i+1,R,le+ri,ri);
    MIN(ret,now2);
  }
  // VALUE(ret);
  return ret;
}

int main()
{
  // RESET(dp,-1);
  scanf("%d",&n);
  REP(i,n) scanf("%lld",&data[i]);
  if (n == 2)
  {
    printf("%lld\n",data[0] + data[1]);
    return 0;
  }
  // LL res = jahja(1,n-2,)
  LL res = INFF;
  FOR(i,1,n-1)
  {
    LL a = jahja(1,i-1,1,2) + jahja(i+1,n-2,2,1);
    a += data[i] * 2;
    a += data[0] + data[n-1];
    MIN(res,a);
  }
  printf("%lld\n",res);
  // vi v;
  // int n = 6;
  // int now = 1;
  // FORN(i,1,n)
  // {
  //   v.pb(now);
  //   now *= 10;
  // }
  // f(v);
  // SORT(res);
  // res.erase(unique(ALL(res)),res.end());
  // REP(i,SIZE(res)) debug("%d\n",res[i]);
  // VALUE(SIZE(res));
  return 0;
}











Measured memory_bytes: 8448