#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;cin >> n;
    vector<ll> a(n),b(n);
    rep(i,n){
        cin >> a[i] >> b[i];
    }
    vector<ll> dl(1<<(n/2)),dr(1<<(n-n/2));
    rep(i,(1<<(n/2))){
        rep(j,n/2){
            if(i&(1<<j)){
                dl[i]+=a[j];
            }
            else{
                dl[i]-=b[j];
            }
        }
    }
    rep(i,(1<<(n-n/2))){
        rep(j,n-n/2){
            if(i&(1<<j)){
                dr[i]+=a[j+n/2];
            }
            else{
                dr[i]-=b[j+n/2];
            }
        }
    }
    ll ans=INF;
    sort(dr.begin(),dr.end());
    rep(i,(1<<(n/2))){
        ll t=lower_bound(dr.begin(),dr.end(),-dl[i])-dr.begin();
        if(t!=0){
            chmin(ans,abs(dr[t-1]+dl[i]));
        }
        if(t!=dr.size()){
            chmin(ans,abs(dr[t]+dl[i]));
        }
    }
    cout << ans << endl;
}