#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<int>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define allpt(v) (v).begin(), (v).end()

const int mod = 1e9 + 7;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(vector<T> v)
{
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;
    return;
}

void makeset(int ps, set<ll> &p_set, vector<PLL> p)
{
    ll a, b, r;
    rep(i, pow(2, ps))
    {
        a = b = 0;
        r = i;
        rep(j, ps)
        {
            if (r % 2)
                a += p[j].first;
            else
                b += p[j].second;
            r /= 2;
        }
        p_set.insert(a - b);
    }
}

int main()
{

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    int n, ps, qs, r;
    cin >> n;
    ll a, b, ab, ans;
    vector<PLL> p, q;
    set<ll> p_set, q_set;

    rep(i, n)
    {
        cin >> a >> b;
        if (i % 2)
            p.push_back(make_pair(a, b));
        else
            q.push_back(make_pair(a, b));
    }
    ps = p.size(), qs = q.size();

    makeset(ps, p_set, p);
    makeset(qs, q_set, q);


    ans = 1e16;
    for (auto z : p_set)
    {
        auto itrr = q_set.lower_bound(-z);
        auto itrl = itrr;
        if (itrr != q_set.begin())
            itrl--;
        if (itrr == q_set.end())
            itrr--;

        ab = min(abs(*itrl + z), abs(*itrr + z));
        ans = min(ans , ab);
    }
    cout << ans << rt;
    return 0;
}