#include <cstdio> #include <iostream> #include <string> #include <sstream> #include <stack> #include <algorithm> #include <cmath> #include <queue> #include <map> #include <set> #include <cstdlib> #include <bitset> #include <tuple> #include <assert.h> #include <deque> #include <bitset> #include <iomanip> #include <limits> #include <chrono> #include <random> #include <array> #include <unordered_map> #include <functional> #include <complex> #include <numeric> template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } //constexpr long long MAX = 5100000; constexpr long long INF = 1LL << 60; constexpr int inf = 1000000007; constexpr long long mod = 1000000007LL; //constexpr long long mod = 998244353LL; const long double PI = acos((long double)(-1)); using namespace std; typedef unsigned long long ull; typedef long long ll; typedef long double ld; vector<ll> BruteForce(vector<ll>& a, vector<ll>& b) { int n = a.size(); vector<ll> res; res.emplace_back(0); for (int i = 0; i < n; i++) { vector<ll> cur1; vector<ll> cur2; for (auto p : res) { cur1.emplace_back(p - b[i]); cur2.emplace_back(p + a[i]); } res.clear(); res.resize(cur1.size() + cur2.size()); merge(cur1.begin(), cur1.end(), cur2.begin(), cur2.end(), res.begin()); } return res; } int main() { /* cin.tie(nullptr); ios::sync_with_stdio(false); */ int n; scanf("%d", &n); vector<ll> a(n), b(n); for (int i = 0; i < n; i++) scanf("%lld %lld", &a[i], &b[i]); vector<ll> v1, v2; { int h = n / 2; auto ta1 = a, tb1 = b; vector<ll> ta2, tb2; while (ta1.size() > h) { ta2.emplace_back(ta1.back()); tb2.emplace_back(tb1.back()); ta1.pop_back(); tb1.pop_back(); } v1 = BruteForce(ta1, tb1); v2 = BruteForce(ta2, tb2); reverse(v1.begin(), v1.end()); } int cur = 0; ll res = INF; for (int i = 0; i < v1.size(); i++) { while (cur < v2.size() and v1[i] + v2[cur] < 0) cur++; if (cur) chmin(res, -(v1[i] + v2[cur - 1])); if (cur < v2.size()) chmin(res, v1[i] + v2[cur]); } cout << res << endl; return 0; }