1152-ans

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <string.h>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <sstream>
#include <stack>
#include <cassert>

#define pb push_back
#define mp make_pair
#define PI 3.1415926535897932384626433832795
#define sqr(x) (x)*(x)
#define forn(i, n) for(int i = 0; i < n; ++i)
#define ALL(x) x.begin(), x.end()
#define F first
#define S second
#define m0(x) memset(x,0,sizeof(x))
#define m1(x) memset(x,-1,sizeof(x))
#define CC(x) cout << (x) << "\n"
#define pw(x) (1ull<<(x))
#define bit(m,n) ((m>>n)&1)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
const int INF = 2147483647;
const ll LLINF = 9223372036854775807LL;

int n;
int a[30];
int m[pw(21)];
int sum;
int ans=INF;

void dfs(int mask, int now) {
  if (sum==0) {
    if (now<ans) ans=now;
    return;
  }
  if (now>=ans) return;
  if (m[mask]!=0 && now>=m[mask]) return;
  m[mask]=now;
  int kill, cur;
  int f1,f2,f3;
  for (int i=0;i<n;i++) {
    f1=i,f2=i+1,f3=i+2;
    if (f2>=n) f2-=n;
    if (f3>=n) f3-=n;
    kill = 0;
    if (!bit(mask,f1)) kill+=a[f1];
    if (!bit(mask,f2)) kill+=a[f2];
    if (!bit(mask,f3)) kill+=a[f3];
    if (kill==0) continue;
    sum-=kill;
    cur = mask|pw(f1)|pw(f2)|pw(f3);
    dfs(cur,now+sum);
    sum+=kill;
  }
}

int main() {
  //freopen("input.txt", "r", stdin);
  //freopen("output.txt", "w", stdout);
  scanf("%d", &n);
  for (int i=0;i<n;i++) {
    scanf("%d", &a[i]);
    sum+=a[i];
  }
  dfs(0,0);
  printf("%d\n", ans);
  return 0;
}