1152-easy

#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))

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 mi = INF;
int sum = 0;

void dfs(int g) {
  //cout << g << "\n";
  if (sum==0) {
    if (g<mi) mi=g;
    return;
  }
  if (g>=mi) return;
  int kill=0;
  int a1, a2, a3;
  int f1,f2,f3;
  for (int i=0;i<n;i++) {
    f1 = i, f2 = (i+1)%n, f3 = (i+2)%n;
    a1=a[f1], a2=a[f2], a3=a[f3];
    kill = a1+a2+a3;
    if (kill==0) continue;
    a[f1]=0, a[f2]=0, a[f3]=0;
    sum-=kill;
    dfs(g+sum);
    a[f1]=a1, a[f2]=a2, a[f3]=a3;
    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);
  printf("%d\n", mi);
  return 0;
}