#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<vector<long long> > x(2), y(2);
    for(int i=0; i<n; ++i){
        long long a, b;
        cin >> a >> b;
        x[i%2].push_back(a);
        y[i%2].push_back(b);
    }

    vector<vector<long long> > v(2);
    for(int i=0; i<2; ++i){
        int m = x[i].size();
        for(int j=0; j<(1<<m); ++j){
            bitset<32> bs(j);
            long long sum = 0;
            for(int k=0; k<m; ++k){
                if(bs[k])
                    sum += x[i][k];
                else
                    sum -= y[i][k];
            }
            v[i].push_back(sum);
        }
    }
    
    sort(v[0].begin(), v[0].end());
    long long ans = LLONG_MAX;
    for(long long a : v[1]){
        auto it = lower_bound(v[0].begin(), v[0].end(), -a);
        if(it != v[0].end())
            ans = min(ans, abs(a + *it));
        if(it != v[0].begin()){
            -- it;
            ans = min(ans, abs(a + *it));
        }
    }
    cout << ans << endl;

    return 0;
}