#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;

    vector<P> u, v;
    
    rep(i,n){
        ll a, b;
        cin >> a >> b;
        if(i % 2 == 0) u.push_back(P(a,b));
        else v.push_back(P(a,b));
    }

    
    

    int m = u.size(), w = v.size();
    vector<ll> dp;
    rep(i,1<<m){
        bitset<20> bi(i);
        ll tmp = 0;
        rep(j,m){
            if(bi[j]) tmp += u[j].first;
            else tmp -= u[j].second;
        }
        dp.push_back(tmp);
    }
    sort(dp.begin(), dp.end());

    
    ll ans = 1001001001001001001;

    rep(i,1<<w){
        bitset<20> bi(i);
        ll tmp = 0;
        rep(j,w){
            if(bi[j]) tmp += v[j].first;
            else tmp -= v[j].second;
        }
        tmp *= -1;
        int ite = lower_bound(dp.begin(), dp.end(), tmp) - dp.begin();
        if(ite == 0){
            ans = min(ans, abs(dp[ite]-tmp));
        }else if(ite == dp.size()){
            ans = min(ans, abs(dp[ite-1]-tmp));
        }else{
            ans = min(ans, abs(dp[ite]-tmp));
            ans = min(ans, abs(dp[ite-1]-tmp));
        }
    }

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