#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=100010;
const int INF=0x3f3f3f3f3f3f3f3f;
int n;
int ans=INF;
int a[N],b[N];
vector<int>val1,val2;
signed main(){
//	freopen("even.in","r",stdin);
//	freopen("even.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
	int siz1=n/2;
	int siz2=(n+1)/2;
	for(int S=0;S<(1<<siz1);S++){
		int x=0;
		for(int i=1;i<=siz1;i++){
			if((S>>i-1)&1)x+=a[i];
			else x-=b[i];
		}
		val1.push_back(x);
	}
	for(int S=0;S<(1<<siz2);S++){
		int x=0;
		for(int i=1;i<=siz2;i++){
			if((S>>i-1)&1)x+=a[siz1+i];
			else x-=b[siz1+i];
		}
		val2.push_back(x);
	}
	sort(val1.begin(),val1.end());
	sort(val2.begin(),val2.end());
	for(int i=0;i<val1.size();i++){
		int x=val1[i];
		int id=lower_bound(val2.begin(),val2.end(),-x)-val2.begin();
		int l=max(0ll,id-10);
		int r=min((int)val2.size()-1,id+10);
		for(int j=l;j<=r;j++)ans=min(ans,abs(val1[i]+val2[j]));
	}
	cout<<ans<<"\n";
	return 0;
}