/**
	author:  shobonvip
	created: 2026.09.09 21:21:33
**/

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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n; cin >> n;
	vector<ll> a(n);
	rep(i,0,n) cin >> a[i];

	ll sma = sum(a);

	int half = n/2;
	vector<vector<ll>> b(half+1);
	rep(i,0,1<<half) {
		ll tmp = 0;
		int siz = 0;
		rep(j,0,half) {
			if (i>>j&1) {
				tmp += a[j];
				siz++;
			}
		}
		b[siz].emplace_back(tmp);
	}

	rep(i,0,half+1) {
		sort(all(b[i]));
	}

	// sum(a)/2 以下の最大

	ll ans = 1e18;
	rep(i,0,1<<(n-half)){
		ll tmp = 0;
		int siz = 0;
		rep(j,0,n-half) {
			if (i >> j & 1) {
				tmp += a[j + half];
				siz++;
			}
		}
		if (!(0 <= n/2 - siz && n/2 - siz <= half)){continue;}
		int tb = n/2-siz;
		int tar = int(upper_bound(all(b[tb]), sma/2 - tmp) - b[tb].begin());
		if (tar-1 >= 0) {
			ll w = b[tb][tar-1] + tmp;
			chmin(ans, abs(w - (sma - w)));
		}
		if (tar < (int)b[tb].size()) {
			ll w = b[tb][tar] + tmp;
			chmin(ans, abs(w - (sma - w)));
		}
	}
	cout << ans << endl;
}