#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define INF_LL (ll)1e18 #define INF (int)1e9 #define REP(i, n) for(int i = 0;i < (n);i++) #define FOR(i, a, b) for(int i = (a);i < (b);i++) #define all(x) x.begin(),x.end() using ll = long long; using PII = pair; templateinline void chmin(A &a, B b){if(a > b) a = b;} templateinline void chmax(A &a, B b){if(a < b) a = b;} class Union_find{ private: vector par; vector rank; int n; public: Union_find(int a){ n = a; for(int i = 0;i < n;i++){ par.push_back(i); rank.push_back(0); } } int find(int x){ if(par[x] == x){ return x; }else{ return par[x] = find(par[x]); } } void unite(int x, int y){ x = find(x); y = find(y); if(x == y) return; if(rank[x] < rank[y]){ par[x] = y; }else{ par[y] = x; if(rank[x] == rank[y]) rank[x]++; } } bool same(int x, int y){ return find(x) == find(y); } }; class LazySegTree{ private: int n; vector node, lazy; vector lazyFlag; public: LazySegTree(vector v){ int sz = v.size(); n = 1; while(n < sz) n *= 2; node.resize(2*n-1, 0); lazy.resize(2*n-1, 0); lazyFlag.resize(2*n-1, false); REP(i, sz) node[i+n-1] = v[i]; for(int i = n-2;i >= 0;i--) node[i] = node[2*i+1]+node[2*i+2]; } void eval(int k, int l, int r){ if(lazyFlag[k]){ node[k] += lazy[k] * (r-l); if(r-l > 1){ lazy[2*k+1] += lazy[k]; lazy[2*k+2] += lazy[k]; lazyFlag[2*k+1] = lazyFlag[2*k+2] = true; } lazy[k] = 0; lazyFlag[k] = false; } } void add(int a, int b, ll x, int k=0, int l=0, int r=-1){ if(r < 0) r = n; eval(k, l, r); if(b <= l || r <= a) return; if(a <= l && r <= b){ lazy[k] += x; lazyFlag[k] = true; eval(k, l, r); }else{ add(a, b, x, k*2+1, l, (l+r)/2); add(a, b, x, k*2+2, (l+r)/2, r); node[k] = node[k*2+1] + node[k*2+2]; } } ll query(int a, int b, int k=0, int l=0, int r=-1){ if(r < 0) r = n; eval(k, l, r); if(b <= l || r <= a) return 0; if(a <= l && r <= b) return node[k]; return query(a, b, k*2+1, l, (l+r)/2) + query(a, b, k*2+2, (l+r)/2, r); } }; class Bucket{ private: int n, bs, bn; vector data; vector bucket, lazy; vector lazyFlag; public: Bucket(vector v, int sz){ data = v; n = v.size(); bs = sz; bn = (n + bs - 1) / bs; data.resize(bn*bs, INF_LL); bucket.assign(bn, INF_LL); lazy.assign(bn, 0); lazyFlag.assign(bn, 0); REP(i, bn){ ll minx = INF_LL; REP(j, bs){ chmin(minx, data[i*bs+j]); } bucket[i] = minx; } } void eval(int k){ if(lazyFlag[k]){ lazyFlag[k] = false; FOR(i, bs*k, bs*(k+1)){ data[i] = lazy[k]; } lazy[k] = 0; } } void update(int s, int t, int x){ REP(k, bn){ int l = k*bs, r = (k+1)*bs; if(r <= s || t <= l) continue; if(s <= l && r <= t){ lazyFlag[k] = true; bucket[k] = x; lazy[k] = x; }else{ eval(k); FOR(i, max(s, l), min(t, r)){ data[i] = x; } bucket[k] = INF_LL; FOR(i, l, r){ chmin(bucket[k], data[i]); } } } } ll query(int s, int t){ ll res = INF_LL; REP(k, bn){ int l = k*bs, r = (k+1)*bs; if(r <= s || t <= l) continue; if(s <= l && r <= t){ chmin(res, bucket[k]); }else{ eval(k); FOR(i, max(s, l), min(t, r)){ chmin(res, data[i]); } } } return res; } }; int main(void){ cin.tie(0); ios::sync_with_stdio(false); int n; vector sa; cin >> n; ll a[33], b[33]; REP(i, n){ cin >> a[i] >> b[i]; } REP(i, 1 << (n+1)/2){ ll a_s= 0, b_s = 0; REP(j, (n+1)/2){ if((i >> j) & 1){ a_s += a[j]; }else{ b_s += b[j]; } } sa.push_back(a_s-b_s); } sort(all(sa)); ll res = INF_LL; REP(i, 1 << n/2){ ll a_s = 0, b_s = 0; REP(j, n/2){ if((i >> j) & 1){ a_s += a[j+(n+1)/2]; }else{ b_s += b[j+(n+1)/2]; } } int in = lower_bound(all(sa), b_s-a_s)-sa.begin(); chmin(res, abs(sa[in]+(a_s-b_s))); if(in > 0) chmin(res, abs(sa[in-1]+(a_s-b_s))); } cout << res << endl; }