#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
void halr_sum(vector<long long int> a,vector<long long int> b,long long int temp_sum,int i,int end, vector<long long int> &sum){
    if(i==end){

        sum.push_back(temp_sum);

        return;
    }

    halr_sum(a,b,temp_sum + a[i],i+1,end,sum);
    halr_sum(a,b,temp_sum - b[i],i+1,end,sum);
}
int main(){
    int n;
    cin >> n;
    vector<long long int> a(n),b(n);
    for(int i=0; i<n; i++){
        cin >> a[i]>>b[i];
    }

    int lc=n/2,rc=n-lc;
    vector<long long int> l(lc),r(rc);

    vector<long long int> lsum,rsum;

    halr_sum(a,b,0,0,lc,lsum);
    halr_sum(a,b,0,lc,n,rsum);


    sort(lsum.begin(),lsum.end());
    sort(rsum.begin(),rsum.end());

    cout << "--" << endl;
    for(int k = 0; k < lsum.size(); k++){
        cout << lsum[k] << endl;
    }
    cout << "--" << endl;
    for(int k = 0; k < rsum.size(); k++){
        cout << rsum[k] << endl;
    }
    cout << "--" << endl;
    long long ans = 5000000000;
    int rnum = rsum.size()-1;
    int lnum = 0;
    while(lnum < lsum.size() && rnum > 0){
        if(llabs(lsum[lnum] + rsum[rnum]) > llabs(lsum[lnum] + rsum[rnum - 1])){
            rnum--;
        }else{
            ans = min(ans,llabs(lsum[lnum] + rsum[rnum]));
            cout << ans << " : " << lsum[lnum] << "," << rsum[rnum]<<endl;
            cout << "l : " << lnum << " r : " << rnum << endl;
            lnum++;
        }
    }
    if(lnum < lsum.size()){
        ans = min(ans,llabs(lsum[lnum] + rsum[rnum]));
    }


    cout << ans << endl;
    return 0;
}