#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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;}
//-------------------------------------------------------

int N;
int A[40];

vector<ll> cand[41];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) cin>>A[i];
	int mask;
	FOR(mask,1<<(N/2)) {
		int num=20;
		ll sum=0;
		FOR(i,N/2) {
			if(mask&(1<<i)) num++,sum+=A[i];
			else num--,sum-=A[i];
		}
		cand[num].push_back(sum);
	}
	FOR(i,41) {
		cand[i].push_back(-1LL<<60);
		cand[i].push_back(1LL<<60);
		sort(ALL(cand[i]));
	}
	ll ret=1LL<<60;
	FOR(mask,1<<(N/2)) {
		int num=20;
		ll sum=0;
		FOR(i,N/2) {
			if(mask&(1<<i)) num--,sum-=A[i+N/2];
			else num++,sum+=A[i+N/2];
		}
		x=lower_bound(ALL(cand[num]),sum)-cand[num].begin();
		ret=min(ret,abs(cand[num][x]-sum));
		ret=min(ret,abs(cand[num][x-1]-sum));
	}
	cout<<ret<<endl;
	
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}