#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector veci; typedef vector vecll; typedef vector vecs; template using Hash=unordered_map; #define REP(i, a, n) for(ll i = a; i < (ll)n; i++) #define RREP(i, a, n) for(ll i = n-1; i >= (ll)a; i--) #define rep(i, n) REP(i, 0, n) #define rrep(i, n) RREP(i, 0, n) #define MD 1000000007 template T read(){T a;cin >> a;return a;} template void read(T& a){cin >> a;} template void read(T& a, Args&... args){cin >> a; read(args...);} template void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}} template void write(T a){cout << fixed << setprecision(4) << a << endl;} template void write(T a, Args... args){cout << fixed << setprecision(4) << a << c; write(args...);} template void warr(vector a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;} template void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;} void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}} void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}} ull gcd(ull a, ull b){while(true){ull k = a % b;if(k == 0)return b;a = b;b = k;}} ull comb(ull n, ull m){ull p=1;m=min(m,n-m);for(ull i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;} int main(void) { int n; ll a[32],b[32]; read(n); rep(i,n)read(a[i],b[i]); if(n==1){ write(min(a[0],b[0])); return 0; } int n1=n/2; int n2=n-n1; ll nn1=1LL< s(nn1,0); rep(i,nn1){ rep(j,n1){ if((i&(1<0)s[i]+=a[j]; else s[i]-=b[j]; } //write(i,s[i]); } sort(s.begin(),s.end()); ll res=1LL<<62; rep(i,nn2){ ll t=0; rep(j,n2){ if((i&(1<0)t+=a[j+n1]; else t-=b[j+n1]; } //write(i,t); auto g=lower_bound(s.begin(),s.end(),-t); if(g!=s.begin())res=min(res,llabs(*(g-1)+t)); if(g==s.end())continue; if(g!=(s.end()-1))res=min(res,llabs(*(g+1)+t)); res=min(res,llabs(*g+t)); } write(res); return 0; }