/**
 * @file qoj8645-3.cpp
 * @author n685
 * @brief
 * @date 2024-06-09
 *
 *
 */
#include <bits/stdc++.h>

#ifdef LOCAL
#include "dd/debug.h"
#else
#define dbg(...) 42
#define dbgR(...) 4242
#define dbgP(...) 420
#define dbgRP(...) 420420
void nline() {}
#endif

auto solve(int n, std::vector<int64_t> a, std::vector<int64_t> b,
           int64_t k) -> std::vector<bool> {
  std::vector<int> ii(n + 1);
  int lb = 0, rb = -1, r = 2 * n - 1;
  for (int i = 0; i < n; ++i) {
    while (lb < n && b[lb] < a[i] - k) {
      ++lb;
    }
    ++rb;
    while (rb < n && b[rb] <= a[i] + k) {
      ++rb;
    }
    --rb;
    while (a[r] < a[i]) {
      --r;
    }
    int least = i + n - r - 1;
    if (rb < least) {
      continue;
    }
    int ll = std::max(0, i - rb);
    int rr = (lb <= least ? i : i - lb);
    if (ll <= rr) {
      ii[ll]++;
      ii[rr + 1]--;
    }
  }
  lb = 0, rb = -1, r = 0;
  for (int i = 2 * n - 1; i >= n; --i) {
    while (lb < n && b[lb] < a[i] - k) {
      ++lb;
    }
    ++rb;
    while (rb < n && b[rb] <= a[i] + k) {
      ++rb;
    }
    --rb;
    while (r < n && a[r] <= a[i]) {
      ++r;
    }
    int least = r - (i - n) - 1;
    if (rb < least) {
      continue;
    }
    int ll = (lb <= least ? i - n + 1 : lb + i - n + 1);
    int rr = std::min(n - 1, rb + i - n + 1);
    if (ll <= rr) {
      ii[ll]++;
      ii[rr + 1]--;
    }
  }
  std::vector<bool> ans(n);
  for (int i = 0; i < n; ++i) {
    if (i > 0) {
      ii[i] += ii[i - 1];
    }
    ans[i] = (ii[i] == n);
  }
  return ans;
}

auto main() -> int {
#ifndef LOCAL
  std::cin.tie(nullptr)->sync_with_stdio(false);
#endif

  int n;
  std::cin >> n;
  std::vector<int64_t> a(2 * n), b(n), c(n);
  for (auto &i : a) {
    std::cin >> i;
  }
  for (auto &i : b) {
    std::cin >> i;
  }
  for (auto &i : c) {
    std::cin >> i;
  }
  std::sort(b.begin(), b.end());
  std::sort(c.begin(), c.end());
  std::vector<int64_t> a2 = a, b2 = b, c2 = c;
  std::rotate(a2.begin(), a2.begin() + n, a2.end());
  std::reverse(b2.begin(), b2.end());
  std::reverse(c2.begin(), c2.end());
  for (auto &i : a2) {
    i = -i;
  }
  for (auto &i : b2) {
    i = -i;
  }
  for (auto &i : c2) {
    i = -i;
  }
  auto good = [&](int64_t k) {
    std::vector<bool> r1 = solve(n, a, b, k), r2 = solve(n, a2, c2, k);
    std::vector<bool> r3 = solve(n, a, c, k), r4 = solve(n, a2, b2, k);
    for (int i = 0; i < n; ++i) {
      if ((r1[i] && r2[i]) || (r3[i] && r4[i])) {
        return true;
      }
    }
    return false;
  };
  int64_t l = 0, r = static_cast<int64_t>(1e9);
  while (l < r) {
    int64_t mid = (l + r) / 2;
    if (good(mid)) {
      r = mid;
    } else {
      l = mid + 1;
    }
  }
  std::cout << l << '\n';
}