#include <iostream>
#include <vector>
#include <set>

using lint = long long;
constexpr lint INF = 1LL << 50;

lint asum = 0;

std::set<lint> calc(int n) {
    std::vector<lint> ds(n);
    for (auto& d : ds) {
        lint a, b;
        std::cin >> a >> b;
        asum += a;
        d = b + a;
    }

    std::set<lint> ret{-INF, INF};
    for (int b = 0; b < (1 << n); ++b) {
        lint sum = 0;
        for (int i = 0; i < n; ++i) {
            if ((b >> i) & 1) sum += ds[i];
        }
        ret.insert(sum);
    }

    return ret;
}

void solve() {
    int n;
    std::cin >> n;

    auto fs = calc(n / 2),
         bs = calc(n - n / 2);

    lint ans = INF;
    for (auto f : fs) {
        if (std::abs(f) == INF) continue;

        // f + b >= asum, as small as possible
        auto b = *bs.lower_bound(asum - f);
        ans = std::min(ans, std::abs(f + b - asum));

        // f + b <= asum, as large as possible
        b = *(--bs.upper_bound(asum - f));
        ans = std::min(ans, std::abs(f + b - asum));
    }

    std::cout << ans << "\n";
}

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

    solve();

    return 0;
}