#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
int main(){
    ll n;cin >> n;
    vl a(n),b(n);rep(i,n)cin >> a[i] >> b[i];
    ll p=n/2,q=n-p;
    auto fx=[&](ll l){
        vl ret;
        rep(bit,1<<l){
            ll now=0;
            rep(i,l){
                if(bit>>i&1)now+=a[i];
                else now-=b[i];
            }
            ret.emplace_back(abs(now));
        }
        sort(all(ret));
        return ret;
    };
    vl fa=fx(p);
    rev(all(a));rev(all(b));
    vl fb=fx(q);
    ll ans=INF;
    for(auto now:fa){
        auto itr=lower_bound(all(fb),now);
        if(itr!=fb.end())chmin(ans,abs(now-*itr));
        if(itr!=fb.begin())itr--;
        chmin(ans,abs(now-*itr));
    }
    cout << ans << endl;
}