#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
const int N = 40;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll n;
ll a[N], b[N];
ll f[1 << 17];
int main(int argc, char const *argv[])
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cin >> n;
    for (ll i = 1; i <= n; i++)
        cin >> a[i] >> b[i];
    ll full = (1 << (n >> 1));
    for (ll S = 0; S < full; S++)
    {
        ll sum1 = 0, sum2 = 0;
        for (ll i = 0; i < (n >> 1); i++)
        {
            if ((S >> i) & 1)
                sum1 += a[i + 1];
            else
                sum2 += b[i + 1];
        }
        f[S + 1] = sum1 - sum2;
    }
    sort(f + 1, f + 1 + full);
    ll ans = inf;
    for (ll S = 0; S < (1 << (n - (n >> 1))); S++)
    {
        ll sum1 = 0, sum2 = 0;
        for (ll i = 0; i < n - (n >> 1); i++)
        {
            if ((S >> i) & 1)
                sum1 += a[(n >> 1) + i + 1];
            else
                sum2 += b[(n >> 1) + i + 1];
        }
        ll tmp = sum1 - sum2;
        ll x = lower_bound(f + 1, f + 1 + full, -tmp) - f;
        ans = min(ans, abs(tmp + f[x]));
        x = upper_bound(f + 1, f + 1 + full, -tmp) - f;
        ans = min(ans, abs(tmp + f[x]));
    }
    cout << ans << endl;
    return 0;
}