#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n;
	cin>>n;
	ll a[32], b[32];
	for(int i=0; i<n; i++) cin>>a[i]>>b[i];
	ll d1[1<<16];
	for(int i=0; i<(1<<(n/2)); i++){
		d1[i]=0;
		for(int j=0; j<n/2; j++){
			if(i&(1<<j)) d1[i]=d1[i]+a[j];
			else d1[i]=d1[i]-b[j];
		}
	}
	sort(d1, d1+(1<<(n/2)));
	ll ans=1e12;
	for(int i=0; i<(1<<(n-n/2)); i++){
		ll d=0;
		for(int j=0; j<n-n/2; j++){
			if(i&(1<<j)) d=d+a[n/2+j];
			else d=d-b[n/2+j];
		}
		int i1=lower_bound(d1, d1+(1<<(n/2)), -d)-d1;
		if(i1<(1<<(n/2))) ans=min(ans, abs(d1[i1]+d));
		if(i1>0) ans=min(ans, abs(d1[i1-1]+d));
	}
	cout<<ans<<endl;
	return 0;
}