#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  VL d1[21], d2[21];
  int n;
  cin >> n;
  rep(z, 2) {
    VI a(n / 2);
    rep(i, n / 2) cin >> a[i];
    rep(s, 1 << (n / 2)) {
      ll sm = 0;
      rep(i, n / 2) {
        if ((s >> i & 1) ^ z) sm += a[i];
        else sm -= a[i];
      }
      d1[popcount(0U + s)].emplace_back(sm);
    }
    rep(i, n / 2 + 1) sort(all(d1[i]));
    swap(d1, d2);
  }
  constexpr long long INF = 1002003004005006007;
  ll ans = INF;
  rep(i, n / 2 + 1) {
    int j = n / 2 - i;
    int ptr = 0;
    for (ll x : d1[i]) {
      while (ptr < ssize(d2[j]) && d2[j][ptr] < x) ptr++;
      if (ptr) chmin(ans, x - d2[j][ptr-1]);
      if (ptr < ssize(d2[j])) chmin(ans, d2[j][ptr] - x);
    }
  }
  cout << ans << '\n';
}