#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000

int main(){
  int n;
  cin>>n;
  vector<long> a(n),b(n);
  rep(i,n) cin>>a[i]>>b[i];

  if(n==1){
    cout << min(a[0],b[0]) << endl;
  }

  int m = n/2;
  vector<long> v(1<<m,0);
  rep(mask, 1<<m){
    rep(i,m){
      if(mask&(1<<i)) v[mask] += a[i];
      else v[mask] -= b[i];
    }
  }

  uniq(v);

  long ans = 1234567890234567890L;

  m = (n+1)/2;
  rep(mask, 1<<m){
    long tmp = 0;
    rep(i,m){
      if(mask&(1<<i)) tmp += a[n/2 + i];
      else tmp -= b[n/2 + i];
    }

    auto idx = lower_bound(all(v), -tmp) - v.begin();
    for(int i = max<int>(0,idx-2); i<=min<int>(v.size()-1,idx+2); i++){
      ans = min(ans, abs(tmp + v[i]));
    }
  }

  cout << ans << endl;

  return 0;
}