typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
    ll n,a[32],b[32];
    cin >>n;
    for (int i = 0; i < n; i++) {
        cin >>a[i]>>b[i];
    }
    ll A_B[65536];
    for (int i = 0; i < pow(2,n/2); i++) {
        // std::cout << i << std::endl;
        ll rem=i;
        ll A=0;
        ll B=0;
        ll j=n/2-1;
        while(j>=0){
            if(rem/(ll)pow(2,j)>0){
                rem-=pow(2,j);
                A+=a[j];
            }else{
                B+=b[j];
            }
            j--;
        }
        A_B[i]=A-B;
        // std::cout << A-B << std::endl;
    }
    sort(A_B,A_B+n/2+1);
    
    
    ll A_B_2[65536];
    for (int i = 0; i < pow(2,n-n/2); i++) {
        ll rem=i;
        ll A=0;
        ll B=0;
        ll j=n-n/2-1;
        while(j>=0){
            if(rem/(ll)pow(2,j)>0){
                rem-=pow(2,j);
                A+=a[j+n/2];
            }else{
                B+=b[j+n/2];
            }
            j--;
        }
        A_B_2[i]=A-B;
        // std::cout << A-B << std::endl;
    }
    sort(A_B_2,A_B_2+n-n/2+1);
    
    ll res=5000000000;
    for (int i = 0; i < pow(2,n/2); i++) {
        ll aa=distance(A_B_2,lower_bound(A_B_2, A_B_2+n-n/2+1 , -A_B[i]));
        res=min(res,abs(A_B[i]-A_B_2[aa]));
        if(aa>0){
            res=min(res,abs(A_B[i]-A_B_2[aa-1]));
        }
    }
    std::cout << res << std::endl;
}