#include <bits/stdc++.h>

#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, init, n) for(int i = init; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define Cout(obj) cout << obj << endl
#define Size(obj) (obj).size()
#define fcout cout << fixed << setprecision(10)
#define fi first
#define se second

using namespace std;
using ll = long long int;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using edge = struct
{
    int to, cost;
};

const int MOD = 1e9 + 7;
const int iINF = 1e9;
const long long int llINF = 1e18;
const double PI = acos(-1.0);

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;

    vector<ll> A(N), B(N);
    REP(i, N)
    {
        cin >> A[i] >> B[i];
    }

    int n = N / 2, half = N - n;

    vector<ll> candi;

    REP(S, 1 << n)
    {
        ll sumA = 0, sumB = 0;

        REP(i, n)
        {
            if((S >> i) & 1)
            {
                sumA += A[i];
            }
            else
            {
                sumB += B[i];
            }
        }

        candi.push_back(sumA - sumB);
    }

    ll ans = llINF;

    sort(ALL(candi));

    REP(S, 1 << half)
    {
        ll sumA = 0, sumB = 0;

        REP(i, half)
        {
            if((S >> i) & 1)
            {
                sumA += A[i + n];
            }
            else
            {
                sumB += B[i + n];
            }
        }

        auto itr = lower_bound(ALL(candi), -(sumA - sumB));

        if(itr != candi.begin())
        {
            auto itr2 = itr;
            itr2--;

            ans = min(ans, abs(sumA - sumB + *itr2));
        }

        if(itr != candi.end())
        {
            ans = min(ans, abs(sumA - sumB + *itr));

            itr++;

            if(itr != candi.end())
            {
                ans = min(ans, abs(sumA - sumB + *itr));
            }
        }
    }

    Cout(ans);


    return 0;
}