#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
LL sum=0;
int n=0;
LL A[40];
LL B[40];
LL C[40];
int main(){
    cin>>n;
    REP(i,n){
        cin>>A[i]>>B[i];
    }
    vector<LL>v;
    vector<LL>v2;
    REP(i,1<<(min(16,n))){
        LL now=0;
        REP(j,min(16,n)){
            if((i>>j)&1){
               now+=A[j];
            }else{
               now-=B[j];
            }
        }
        v.push_back(now);
        v2.push_back(-now);
        //cout<<now<<endl;
    }
    sort(v.begin(),v.end());
    sort(v2.begin(),v2.end());
    if(n<=16){
       LL ans=1e12;
       REP(i,v.size()){
           ans=min(ans,abs(v[i]));
       }
       cout<<ans<<endl;
    }else{
       LL ans=1e12;
       REP(i,1<<(min(16,n-16))){
          LL now=0;
          REP(j,min(16,n-16)){
              if((i>>j)&1){
                 now+=A[j+16];
              }else{
                 now-=B[j+16];
              }
          }
          LL a=v[lower_bound(v.begin(),v.end(),-now)-v.begin()];
          LL b=v2[lower_bound(v2.begin(),v2.end(),(now))-v2.begin()];
          //cout<<now<<" "<<a<<" "<<b<<endl;
          ans=min(ans,abs(a+now));
          ans=min(ans,abs(b-now));
      }
      cout<<ans<<endl;

    }
    
    return(0);
}