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

int main(){
    int N;
    cin >> N;
    vector<ll> A(N);
    for (ll& x : A) cin >> x;

    int M = N/2;
    vector<ll> L(A.begin(), A.begin()+M);
    vector<ll> R(A.begin()+M, A.end());
    vector<ll> LS, RS;
    for (int bit = 0; bit < (1<<M); bit++){
        ll ls = 0, rs = 0;
        for (int i = 0; i < M; i++){
            if (bit>>i&1) ls += L[i], rs += R[i];
        }
        LS.push_back(ls);
        RS.push_back(rs);
    }

    ll S = reduce(A.begin(), A.end());
    ll res = 0;
    for (int x : LS){
        auto it = upper_bound(RS.begin(), RS.end(), S/2-x)-1;
        res = max(res, x+*it);
    }

    cout << S-2*res << endl;
}