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

typedef long long ll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n;
    cin >> n;
    vector<ll> r(n);
    for(auto &x : r) cin >> x;
    
    int n1 = n / 2;
    int n2 = n - n1;
    vector<ll> first_half(r.begin(), r.begin() + n1);
    vector<ll> second_half(r.begin() + n1, r.end());
    
    auto generate_subset_sums = [&](const vector<ll> &arr) -> vector<ll> {
        vector<ll> sums = {0};
        for(auto num : arr){
            int sz = sums.size();
            for(int i =0; i < sz; ++i){
                sums.push_back(sums[i] + num);
            }
        }
        return sums;
    };
    
    vector<ll> sums1 = generate_subset_sums(first_half);
    vector<ll> sums2 = generate_subset_sums(second_half);
    
    sort(sums1.begin(), sums1.end());
    sort(sums2.begin(), sums2.end());
    
    vector<ll> all_sums;
    all_sums.reserve(sums1.size() + sums2.size());
    for(auto s1 : sums1){
        for(auto s2 : sums2){
            all_sums.push_back(s1 + s2);
        }
    }
    
    sort(all_sums.begin(), all_sums.end());
    
    ll min_diff = LLONG_MAX;
    for(int i =1; i < all_sums.size(); ++i){
        ll diff = all_sums[i] - all_sums[i-1];
        if(diff < min_diff){
            min_diff = diff;
            if(min_diff ==1){
                break;
            }
        }
    }
    
    cout << min_diff << "\n";
}