#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <algorithm>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define rep(i,n)	for(int i=0;i<n;i++)
#define srep(i,a,n)	for(int i=a;i<n;i++)
#define REP(i,n)	for(int i=0;i<=n;i++)
#define SREP(i,a,n)	for(int i=a;i<=n;i++)
#define rrep(i,n)	for(int i=n-1;i>=0;i--)
#define RREP(i,n)	for(int i=n;i>=0;i--)
#define all(a)	(a).begin(),(a).end()
#define mp(a,b)	make_pair(a,b)
#define mt	make_tuple
#define fst	first
#define scn second
#define bicnt(x)	__buildin__popcount(x)
#define debug(x)	cout<<"debug: "<<x<<endl

const ll inf = (ll)1e18;
const ll mod = (ll)1e9 + 7;
const ld eps = 1e-18;
const int dx[] = { 0,1,0,-1 };
const int dy[] = { 1,0,-1,0 };

vector<ll> s[2];
vector<ll> a, b;

void search(int i, int e, int t, ll val) {
	if (i == e)	s[t].push_back(val);
	else {
		search(i + 1, e, t, val + a[i]);
		search(i + 1, e, t, val - b[i]);
	}
}

int main() {
	int n;	cin >> n;
	a.resize(n);	b.resize(n);
	rep(i, n)	cin >> a[i] >> b[i];
	int n2 = n / 2;
	s[0].reserve(1 << (n2 + 1));
	s[1].reserve(1 << (n2 + 1));
	search(0, n2, 0, 0LL);
	search(n2, n, 1, 0LL);
	sort(all(s[0]));	sort(all(s[1]));
	int m = s[0].size();
	ll ret = inf;
	rep(i, m) {
		int j = lower_bound(s[1].begin(), s[1].end(), -s[0][i]) - s[1].begin();
		if (j > 0)	ret = min(ret, llabs(s[0][i] + s[1][j - 1]));
		if (j < s[1].size())	ret = min(ret, llabs(s[0][i] + s[1][j]));
	}
	cout << ret << endl;
	return 0;
}