#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,ll> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;

int popcount(int x){
    return __builtin_popcount(x);
}

int top_bit(int x){
    if(x==0) return -1;
    return 31-__builtin_clz(x);
}

int main(){
    int N;
    cin>>N;
    vector<ll> R(N);
    for(int i=0;i<N;i++){
        cin>>R[i];
    }
    if(N>25){
        cout<<0<<endl;
        return 0;
    }

    //N<=25

    vector<int> comb;
    auto exh=[&](auto f,int bit,int sum){
        if(popcount(bit)==N/2){
            comb.push_back(sum);
            return;
        }
        for(int i=top_bit(bit)+1;i<N-N/2+popcount(bit)+1;i++){
            f(f,bit|(1<<i),sum+R[i]);
        }
    };

    exh(exh,0,0);
    sort(comb.begin(),comb.end());
    int ans=inf;
    for(int i=0;i+1<comb.size();i++){
        ans=min(ans,abs(comb[i]-comb[i+1]));
    }
    cout<<ans<<endl;
}