#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <tuple>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n;
ll a[32], b[32];

ll solve() {
    vector<ll> dif0, dif1;
    int m = n / 2, l = n - m;
    for (int i = 0; i < (1<<m); i++) {
        ll d = 0;
        for (int j = 0; j < m; j++) {
            if ((i>>j)&1) d += a[j];
            else d -= b[j];
        }
        dif0.push_back(d);
    }
    for (int i = 0; i < (1<<l); i++) {
        ll d = 0;
        for (int j = m; j < n; j++) {
            if ((i>>(j-m))&1) d += a[j];
            else d -= b[j];
        }
        dif1.push_back(d);
    }
    sort(ALL(dif1));
    
    ll res = 1e18;
    for (int i = 0; i < dif0.size(); i++) {
        int k = (int)(lower_bound(ALL(dif1), -dif0[i]) - dif1.begin());
        res = min(res, abs(dif0[i] + dif1[k]));
        if (k > 0) res = min(res, abs(dif0[i] + dif1[k-1]));
        if (k < dif1.size()-1) res = min(res, abs(dif0[i] + dif1[k+1]));
    }
    return res;
}

void input() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}