#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll INF = 1000000000000000LL;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	vector<ll> a(n), b(n);
	for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
	int n1 = n / 2, n2 = n - n1;

	vector<ll> v1(1 << n1, 0);
	for (int i = 0; i < (1 << n1); i++) {
		for (int j = 0; j < n1; j++) {
			if (i & (1 << j)) {
				v1[i] += a[j];
			} else {
				v1[i] -= b[j];
			}
		}
	}
	sort(v1.begin(), v1.end());

	vector<ll> v2(1 << n2, 0);
	for (int i = 0; i < (1 << n2); i++) {
		for (int j = 0; j < n2; j++) {
			if (i & (1 << j)) {
				v2[i] += a[n1 + j];
			} else {
				v2[i] -= b[n1 + j];
			}
		}
	}
	sort(v2.begin(), v2.end());

	ll ans = INF;
	for (ll x : v1) {
		int idx = lower_bound(v2.begin(), v2.end(), -x) - v2.begin();
		ans = min(ans, abs(x + v2[idx]));
		if (ans == 0) break;
		if (idx > 0) ans = min(ans, abs(x + v2[idx - 1]));
	}
	cout << ans << endl;
	return 0;
}