#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>

using namespace std;

#define ll long long

int N;
std::vector<int> a, b;

ll dfs(ll aa, ll bb, int n) {
    if (n == N) {
        return abs(aa - bb);
    }
    ll aaa = dfs(aa + a[n], bb, n + 1);
    ll baa = dfs(aa, bb + b[n], n + 1);
    return min(aaa, baa);
}

int main() {
    cin >> N;
    a = std::vector<int>(N);
    b = std::vector<int>(N);
    for (size_t i = 0; i < N; i++) {
        cin >> a[i] >> b[i];
    }
    cout << dfs(0, 0, 0) << endl;
    return 0;
}