#include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#define REP(i, n) for(long long i = 0; i < n; ++i)
#define ALL(a) a.begin(), a.end()
#define INF (long long)1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

int main() {
	int n;
	cin>>n;
	vector<P> a(n);
	REP(i, n) cin>>a[i].first>>a[i].second;
	int half = n/2;
	set<ll> aover1;
	set<ll> bover1;
	set<ll> aover2;
	set<ll> bover2;
	for(ll bit = 0; bit < (1<<half); ++bit) {
		ll asum = 0, bsum = 0;
		REP(i, half) {
			if((bit>>i)&1) asum += a[i].first;
			else bsum += a[i].second;
		}
		if(asum >= bsum) aover1.insert(asum - bsum);
		if(asum <= bsum) bover1.insert(bsum - asum);
	}
	for(ll bit = 0; bit < (1<<(n - half)); ++bit) {
		ll asum = 0, bsum = 0;
		REP(i, n - half) {
			if((bit>>i)&1) asum += a[half + i].first;
			else bsum += a[half + i].second;
		}
		if(asum >= bsum) aover2.insert(asum - bsum);
		if(asum <= bsum) bover2.insert(bsum - asum);
	}
	ll res = INF * INF;
	if(aover1.size() > 0 && aover2.size() > 0) res = min(res, *(aover1.begin()) + *(aover2.begin()));
	if(bover1.size() > 0 && bover2.size() > 0) res = min(res, *(bover1.begin()) + *(bover2.begin()));
	vector<ll> ao1(aover1.size());
	vector<ll> ao2(aover2.size());
	vector<ll> bo1(bover1.size());
	vector<ll> bo2(bover2.size());
	auto ite = aover1.begin();
	int roc = 0;
	while(ite != aover1.end()) {
		ao1[roc] = *ite;
		++ite;
		++roc;
	}
	ite = aover2.begin();
	roc = 0;
	while(ite != aover2.end()) {
		ao2[roc] = *ite;
		++ite;
		++roc;
	}
	ite = bover1.begin();
	roc = 0;
	while(ite != bover1.end()) {
		bo1[roc] = *ite;
		++ite;
		++roc;
	}
	ite = bover2.begin();
	roc = 0;
	while(ite != bover2.end()) {
		bo2[roc] = *ite;
		++ite;
		++roc;
	}
	roc = 0;
	while(roc < ao1.size()) {
		auto ite1 = lower_bound(ALL(bo2), ao1[roc]);
		if(ite1 != bo2.end()) {
			res = min(res, abs(ao1[roc] - *ite1));
		}
		if(ite1 != bo2.begin()) {
			res = min(res, abs(ao1[roc] - *(--ite1)));
		}
		++roc;
	}
	roc = 0;
	while(roc < bo1.size()) {
		auto ite2 = lower_bound(ALL(ao2), bo1[roc]);
		if(ite2 != ao2.end()) {
			res = min(res, abs(bo1[roc] - *ite2));
		}
		if(ite2 != ao2.begin()) {
			res = min(res, abs(bo1[roc] - *(--ite2)));
		}
		++roc;
	}
	cout<<res<<endl;
}