#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int N;
	cin >> N;
	vector<LL> A(N),B(N);
	for(int i=0;i<N;++i){
		cin >> A[i] >> B[i];
	}

	int H = N/2;
	vector<LL> saL;
	for(int s=0;s<(1<<H);++s){
		LL AA = 0;
		LL BB = 0;
		for(int i=0;i<H;++i){
			if( s & (1<<i) ){
				AA += A[i];
			}else{
				BB += B[i];
			}
		}
		saL.push_back( AA-BB );
	}
	sort(saL.begin(), saL.end() );
	int H2 = N-H;
	LL ans = LINF;
	for(int s=0;s<(1<<H2);++s){
		LL AA = 0;
		LL BB = 0;
		for(int i=0;i<H2;++i){
			if( s & (1<<i) ){
				AA += A[i+H];
			}else{
				BB += B[i+H];
			}
		}
		vector<LL>::iterator itr;
		itr = lower_bound(saL.begin(),saL.end(),-(AA-BB));
		if( itr != saL.begin() ){
			--itr;
			LL res = (*itr) +(AA-BB);
			if( abs(ans) > abs(res) ){
				ans = res;
			}
			++itr;
		}
		if( itr != saL.end() ){
			LL res = (*itr) + (AA-BB);
			if( abs(ans) > abs(res) ){
				ans = res;
			}
		}
	}
	cout << abs(ans) << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()