#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
#include<functional>
#include<utility>
using namespace std;
int N;
long long A[32],B[32];
void solve()
{
	cin >> N;
	for(int i = 0;i < N;i++) cin >> A[i] >> B[i];
	vector<long long> d,u;
	for(int i = 0;i < 1 << N/2;i++)
	{
		long long S = 0;
		for(int j = 0;j < N/2;j++)
		{
			if(i >> j & 1) S += A[j];
			else S -= B[j];
		}
		d.push_back(S);
	}

	for(int i = 0;i < 1 << (N-N/2);i++)
	{
		long long S = 0;
		for(int j = 0;j < N-N/2;j++)
		{
			if(i >> j & 1) S += A[j+N/2];
			else S -= B[j+N/2];
		}
		u.push_back(S);
	}
	sort(u.begin(),u.end());
	long long ans = (long long)9e18;
	for(int i = 0;i < (int)d.size();i++)
	{
		auto it = lower_bound(u.begin(),u.end(),-d[i]);
		if(it != u.end()) ans = min(ans,abs(*it+d[i]));
		if(it != u.begin()) ans = min(ans,abs(*(it-1)+d[i]));
	}
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}