#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)

using ll = long long;
using P = std::tuple<int,int>;

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

const ll INF = numeric_limits<ll>::max() / 2;
ll A[32], B[32];
vector<ll> v1, v2;

void enumerate(vector<ll> &v, int offset){
    v.resize(1 << 16);
    for(int i=0;i<1<<16;++i){
        ll a_sum = 0, b_sum = 0;
        for(int j=0;j<16;++j){
            if(i >> j & 1){
                a_sum += A[j + offset];
            }else{
                b_sum += B[j + offset];
            }
        }
        v[i] = a_sum - b_sum;
    }
}

auto mM(const vector<ll>& v, ll x){
    int idx = lower_bound(v.begin(), v.end(), x) - v.begin();
    ll y1 = idx < v.size() ? v[idx] : INF, y2 = idx > 0 ? v[idx-1] : INF;
    return std::make_tuple(y1, y2);
}

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

    int N;
    std::cin >> N;

    for(int i=0;i<N;++i){
        std::cin >> A[i] >> B[i];
    }

    enumerate(v1, 0);
    enumerate(v2, 16);

    sort(v2.begin(), v2.end());

    ll res = INF;
    
    for(ll x : v1){
        ll y1, y2;
        tie(y1, y2) = mM(v2, -x);
        res = min({res, abs(x + y1), abs(x + y2)});
    }

    std::cout << res << std::endl;
}