#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    int n;
    cin >> n;
    vector<ll> a(n), b(n);
    for(int i = 0; i < n; ++i)  cin >> a[i] >> b[i];

    int m = n / 2;
    vector<ll> diffs;
    diffs.emplace_back(-1e+17);
    diffs.emplace_back(1e+17);
    for(int mask = 0; mask < 1 << m; ++mask){
        ll diff = 0;
        for(int i = 0; i < m; ++i){
            if(mask >> i & 1)   diff += a[i];
            else    diff -= b[i];
        }
        diffs.emplace_back(diff);
    }
    sort(begin(diffs), end(diffs));
    diffs.erase(unique(begin(diffs), end(diffs)), end(diffs));

    ll ans = 1e+18;
    for(int mask = 0; mask < 1 << (n - m); ++mask){
        ll diff = 0;
        for(int i = 0; i < n - m; ++i){
            if(mask >> i & 1)   diff += b[m + i];
            else    diff -= a[m + i];
        }
        int i = lower_bound(begin(diffs), end(diffs), diff) - begin(diffs);
        chmin(ans, abs(diff - diffs[i]));
        chmin(ans, abs(diff - diffs[i - 1]));
    }

    cout << ans << endl;
    
    return 0;
}