#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;

int main(){
    int n; cin >> n;
    vector<ll> a1, a2, b1, b2;
    for(int i = 0; i < n; i++){
        ll a, b; cin >> a >> b;
        if(i%2 == 0){
            a1.emplace_back(a);
            b1.emplace_back(b);
        }else{
            a2.emplace_back(a);
            b2.emplace_back(b);
        }
    }

    vector<ll> vec;
    for(int bit = 0; bit < (1 << a2.size()); bit++){
        ll atot = 0, btot = 0;
        for(int i = 0; i < a2.size(); i++){
            if((bit >> i) & 1) atot += a2[i];
            else btot += b2[i];
        }
        vec.emplace_back(atot-btot);
    }
    sort(vec.begin(), vec.end());

    ll ans = 1LL << 60;
    for(int bit = 0; bit < (1 << a1.size()); bit++){
        ll atot = 0, btot = 0;
        for(int i = 0; i < a1.size(); i++){
            if((bit >> i) & 1) atot += a1[i];
            else btot += b1[i];
        }

        int ac = -1, wa = vec.size();
        while(wa-ac > 1){
            int wj = (ac+wa)/2;
            if(atot-btot+vec[wj] <= 0) ac = wj;
            else wa = wj;
        }
        for(int i = ac-1; i <= wa+1; i++){
            if(0 <= i && i < vec.size()){
                ans = min(ans, abs(atot-btot+vec[i]));
            }
        }
    }
    cout << ans << endl;
    return 0;
}