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

typedef unsigned long long ull;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    ull n;
    cin >> n;
    vector<ull> r(n);
    for(auto &x : r) cin >> x;
    
    sort(r.begin(), r.end());
    r.push_back(0);
    
    vector<ull> sum(n+1, 0);
    for(ull i = n; i > 0; --i){
        sum[i-1] = r[i-1] + sum[i];
    }
    
    ull m = n / 2;
    ull size_val = sum[n - m];
    const ull w = 64;
    
    ull dp_size = (size_val / w) + 1;
    vector<ull> dp(dp_size, 0);
    
    ull bit;
    if(m >= 64){
        bit = ~0ULL;
    }
    else{
        bit = (1ULL << m) - 1;
    }
    
    ull s = sum[0] - sum[m];
    
    while(bit < (1ULL << n)){
        ull dp_index = s / w;
        ull dp_bit = s % w;
        if( (dp[dp_index] >> dp_bit) & 1 ){
            cout << "0\n";
            return 0;
        }
        dp[dp_index] |= (1ULL << dp_bit);
        
        if(bit == 0){
            break;
        }
        
        int z = __builtin_ctzll(bit);
        ull shifted = bit >> z;
        int o = __builtin_ctzll(~shifted);
        
        s += r[z + o];
        s -= (sum[z] - sum[z + o]);
        s += (sum[0] - sum[o - 1]);
        
        bit = (bit + (1ULL << z)) | ((1ULL << (o - 1)) - 1);
    }
    
    ull ans = ULLONG_MAX;
    ull up = ULLONG_MAX;
    
    for(ull i = dp_size; i-- > 0; ){
        ull current = dp[i];
        while(current > 0){
            int pos = 63 - __builtin_clzll(current);
            ull u = i * w + pos;
            if(up != ULLONG_MAX){
                ans = min(ans, up - u);
            }
            up = u;
            current &= ~(1ULL << pos);
        }
    }
    
    cout << ans << "\n";
}