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

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N; cin >> N;
    vector<long long> X,Y;
    long long sum = 0;
    for(int i=0; i<N; i++){
        int a; cin >> a; sum += a;
        if(i%2 == 0) X.push_back(a);
        else Y.push_back(a);
    }
    int n = X.size(),m = Y.size(),n2 = 1<<n,m2 = 1<<m;
    vector<vector<long long>> Sx(n+1),Sy(m+1);
    Sx.at(0).push_back(0),Sy.at(0).push_back(0);
    vector<long long> S(n2);
    for(int i=0; i<n2; i++) for(int k=0; k<n; k++) if(i&(1<<k)){
        S.at(i) = S.at(i-(1<<k))+X.at(k);
        Sx.at(__popcount((unsigned)i)).push_back(S.at(i)); break;
    }
    S.resize(m2);
    for(int i=0; i<m2; i++) for(int k=0; k<m; k++) if(i&(1<<k)){
        S.at(i) = S.at(i-(1<<k))+Y.at(k);
        Sy.at(__popcount((unsigned)i)).push_back(S.at(i)); break;
    }
    for(auto &s : Sx) sort(s.begin(),s.end());
    for(auto &s : Sy) sort(s.begin(),s.end());

    long long answer = 1e18;
    for(int i=0; i<=n; i++){
        auto &A = Sx.at(i),&B = Sy.at(N/2-i);
        int pos = B.size();
        for(auto a : A){
            while(pos > 0 && a+B.at(pos-1) >= sum/2) pos--;
            if(pos) answer = min(answer,abs((sum-(a+B.at(pos-1)))-(a+B.at(pos-1))));
            if(pos < B.size()) answer = min(answer,abs((sum-(a+B.at(pos)))-(a+B.at(pos))));
        }
    }

    cout << answer << endl;
}