//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const int N = 1<<16;

//head

int n;
ll U[N];
vector<pair<ll, ll>> u;
ll ans = LINF;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  rep(i, n>>1) {
    ll a, b;
    cin >> a >> b;
    rep(j, 1<<(n>>1)) {
      if(j>>i&1) U[j] += a;
      else U[j] -= b;
    }
  }
  sort(U, U+(1<<(n>>1)));

  rep(i, (n+1)>>1) {
    ll a, b;
    cin >> a >> b;
    u.emplace_back(a, b);
  }

  rep(i, 1<<((n+1)>>1)) {
    ll now = 0;
    rep(j, (n+1)>>1) {
      if(i>>j&1) now += u[j].first;
      else now -= u[j].second;
    }
    ll *itr = upper_bound(U, U+(1<<(n>>1)), -now);
    if(itr != U+(1<<(n>>1))) chmin(ans, abs(*itr+now));
    if(itr != U) chmin(ans, abs(now+*(itr-1)));
  }

  cout << ans << endl;
}