#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
long a[32],b[32];
int n;
vector<long>G;
long ans=1e12;
main()
{
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>a[i]>>b[i];
	}
	for(long i=0;i<1<<(n/2);i++)
	{
		long now=0;
		for(int j=0;j<n/2;j++)
		{
			if(i&(1<<j))now+=a[j];
			else now-=b[j];
		}
		G.push_back(now);
	}
	sort(G.begin(),G.end());
	G.erase(unique(G.begin(),G.end()),G.end());
	for(int i=0;i<1<<(n-n/2);i++)
	{
		long now=0;
		for(int j=0;j<n-n/2;j++)
		{
			if(i&(1<<j))now+=a[j+n/2];
			else now-=b[j+n/2];
		}
		now=-now;
		vector<long>::iterator it=lower_bound(G.begin(),G.end(),now);
		if(it!=G.end())ans=min(ans,abs(-now+*it));
		it--;
		if(it!=G.end())ans=min(ans,abs(-now+*it));
	}
	cout<<ans<<endl;
}