#include<cstdio>
#include<vector>
#include<set>
#include<cstdlib>
#include<algorithm>


using namespace std;

using ll=long long;
using vll=vector<ll>;


void min_u(ll&m, ll v)
{
	if(m<0 || m>v)
	{
		m=v;
	}
}


ll search(vll& u, ll ve)
{
	int s=0, e=u.size()-1, c, r=0;

	while(s<=e)
	{
		c=(s+e)/2;
		ll d=u[c]+ve;

//printf("s=%d  e=%d  c=%d  d=%lld  ve=%lld\n", s, e, c, d, ve);
		if(d==0) return 0;
		if(d>0)
		{
			e=c-1;
			r=c-1;
		}
		else
		{
			s=c+1;
			r=c;
		}
	}

	if(r<0) r=0;
	ll ret=llabs(u[r]+ve);
	if(r+1<u.size()) min_u(ret, llabs(u[r+1]+ve));
	return ret;
}


int main(void)
{
	int n;

	while(scanf("%d", &n)==1)
	{
		vll a(n), b(n);
		set<ll> u, v;
		vll s;

		for(int i=0;i<n;i++)
		{
			scanf("%lld%lld", &a[i], &b[i]);
		}

		u.insert(0);
		for(int i=0;i<n/2;i++)
		{
			auto t=u;
			u.clear();
			for(auto te:t)
			{
				u.insert(te+a[i]);
				u.insert(te-b[i]);
			}
		}

		v.insert(0);
		for(int i=n/2;i<n;i++)
		{
			auto t=v;
			v.clear();
			for(auto te:t)
			{
				v.insert(te+a[i]);
				v.insert(te-b[i]);
			}
		}

		s.reserve(v.size());
		for(auto ve:v)
		{
			s.push_back(ve);
		}

		ll ans=-1;
		for(auto ue:u)
		{
			min_u(ans, search(s, ue));
		}
		printf("%lld\n", ans);
	}

	return 0;
}