#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debugm(m) {printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}}
#define debuga(m,w) {printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}}
#define debugaar(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(l) for(auto cnt=0;cnt<(l);++cnt)
#define iterate(b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

mt19937 mt(8901016);
inline int rand_int(int l, int h) {
    return uniform_int_distribution<>(l, h)(mt);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiablechar(cc); cc = getchar_unlocked());
            for (; isvisiablechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;



// 三分探索 しさくひん
// funcを最小化する値を求める．
// funcの極値は1つであること
// かなり無駄がありそう
ll t_search_proto(ll left, ll right, auto func) {

    repeat(90) {

        ll l = right - (2 * right - 2 * left) / 3;
        ll r = right - (right - left) / 3;

        ll lval = func(l);
        ll rval = func(r);
        // printf("%lld %lld ; %lld->%lld %lld->%lld\n", left, right,l,lval,r,rval);

        if (lval <= rval) {
            right = r;
        }
        else {
            left = l;
        }
        if (left == right)
            return left;
    }
    ll best = func(left);
    ll bestidx = left;
    for (ll t = left + 1; t <= right; ++t) {
        ll f = func(t);
        if (best > f) {
            best = f; bestidx = t;
        }
    }
    return bestidx;
}


ll n;

ll aa[40], bb[40];

namespace guchoku {
    ll memo[40];

    ll dfs(int idx = 0, ll a = 0, ll b = 0) {
        if (memo[idx] < abs(a - b)) return 1e15;
        if (idx == n)
            return abs(a - b);
        return min(dfs(idx + 1, a + aa[idx], b + bb[idx]), dfs(idx + 1, a + bb[idx], b + aa[idx]));
    }
}

vector<ll> stacker;

void dfs_foward(int idx = 0, ll a = 0, ll b = 0) {
    if (idx == 15) {
        stacker.push_back((a - b));
        return;
    }
    dfs_foward(idx + 1, a + aa[idx], b + bb[idx]), dfs_foward(idx + 1, a + bb[idx], b + aa[idx]);
}

ll dfs_backward(int idx = 15, ll a = 0, ll b = 0) {
    if (idx == n) {
        ll ab = a - b;
        int si = t_search_proto(0, stacker.size(), [&ab](ll e) {return abs(ab - stacker[e]); });
        return abs(ab - stacker[si]);
    }
    return min(dfs_backward(idx + 1, a + aa[idx], b + bb[idx]), dfs_backward(idx + 1, a + bb[idx], b + aa[idx]));

}

int main() {
    scanner >> n;

    repeat(n) {
        scanner >> aa[cnt] >> bb[cnt];
    }

    repeat(40) {
        guchoku::memo[cnt] = 5e15; // 5000兆円欲しい！
    }
    if (n <= 18) {
        cout << guchoku::dfs() << endl;
    }
    else {
        dfs_foward();
        sort(ALL(stacker));
        //printf("%d\n",stacker[0]);
        cout << dfs_backward() << endl;
    }


    vector<int> perm(n / 2);


    return 0;
}