#include <bits/stdc++.h>
using namespace std;
int main(void){
    int n;
    cin>>n;
    long long sum=0,ans=1e18;
    int n1=n/2;
    vector<long long>a1(n1),a2(n1);
    for(int i=0;i<n1;i++){
        cin>>a1[i];
        sum+=a1[i];
    }
    for(int i=0;i<n1;i++){
        cin>>a2[i];
        sum+=a2[i];
    }
    vector<set<long long>>s(n1+1);
    for(int bit=0;bit<(1<<n1);bit++){
        long long s1=0,s2=0;
        for(int i=0;i<n1;i++){
            if(bit&(1<<i)){
                s1++;
                s2+=a1[i];
            }
        }
        s[s1].insert(s2);
    }
    for(int bit=0;bit<(1<<n1);bit++){
        long long s1=0,s2=0;
        for(int i=0;i<n1;i++){
            if(bit&(1<<i)){
                s1++;
                s2+=a2[i];
            }
        }
        long long tmp=sum/2-s2;
        auto it=s[n1-s1].lower_bound(tmp);
        if(it!=s[n1-s1].end()){
            long long next=(*it);
            ans=min(ans,abs(sum-(next+s2)*2));
        }
        if(it!=s[n1-s1].begin()){
            long long before=(*prev(it));
            ans=min(ans,abs(sum-(before+s2)*2));
        }
    }
    cout<<ans<<endl;
    return 0;
}