#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main(){
	int n;
	cin >> n;
	int64_t a[n / 2], b[n / 2], c[n - n / 2], d[n - n / 2];
	for(int i = 0; i < n / 2; i++) cin >> a[i] >> b[i];
	for(int i = 0; i < n - n / 2; i++) cin >> c[i] >> d[i];
	vector<int64_t> v, w;
	for(int i = 0; i < 1 << (n / 2); i++){
		int64_t puni = 0;
		for(int j = 0; j < n / 2; j++){
			if(i >> j & 1) puni += a[j];
			else puni -= b[j];
		}
		v.emplace_back(puni);
	}
	for(int i = 0; i < 1 << (n - n / 2); i++){
		int64_t puni = 0;
		for(int j = 0; j < n - n / 2; j++){
			if(i >> j & 1) puni += c[j];
			else puni -= d[j];
		}
		w.emplace_back(puni);
	}
	sort(w.begin(), w.end());
	int64_t ans = 1ll << 60;
	for(int64_t i:v){
		auto itr = lower_bound(w.begin(), w.end(), -i);
		ans = min(ans, abs(i + *itr));
		if(itr != w.begin()) ans = min(ans, abs(i + *--itr));
	}
	cout << ans << endl;
}