#include <bits/stdc++.h>

using namespace std;

long long int n, a, b;
vector <pair<long long int, long long int>> v1, v2;
set <long long int> S;

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> n;

	for (int i = 0; i < n/2; i++)
	{
		cin >> a >> b;
		v1.push_back(make_pair(a, b));
	}

	for (int i = n / 2; i < n; i++)
	{
		cin >> a >> b;
		v2.push_back(make_pair(a, b));
	}

	int m = v1.size();

	for (int i = 0; i < (1<<m); i++)
	{
		long long int sum1 = 0;
		long long int sum2 = 0;
		for (int j = 0; j < m; j++)
		{
			if ((i & (1 << j)))
			{
				sum1 += v1[j].first;
			}
			else
			{
				sum2 += v1[j].second;
			}
		}
		S.insert(sum1 - sum2);
	}

	long long int res = 1e18;

	m = v2.size();
	for (int i = 0; i < (1 << m); i++)
	{
		long long int sum1 = 0;
		long long int sum2 = 0;
		for (int j = 0; j < m; j++)
		{
			if ((i & (1 << j)))
			{
				sum1 += v2[j].first;
			}
			else
			{
				sum2 += v2[j].second;
			}
		}
		long long int val = sum2 - sum1;
		auto it = S.lower_bound(val);
		if (it != S.end())
		{
			long long int val2 = *it;
			long long int diff = abs(sum1 - sum2 + val2);
			res = min(res, diff);
		}
		if (it != S.begin())
		{
			it--;
			long long int val2 = *it;
			long long int diff = abs(sum1 - sum2 + val2);
			res = min(res, diff);
		}
	}

	cout << res << '\n';

	return 0;
}