#include <bits/stdc++.h>

using namespace std;

vector<int> calc(int n, vector<int> a, vector<int> b, int d) {
    vector<int> res(n * 2 + 1), rev = a;
    reverse(rev.begin(), rev.end());
    auto append = [&](int l, int r) {
        l = (l + 2 * n) % (2 * n), r = (r + 2 * n) % (2 * n);
        if (l < r) ++res[l], --res[r + 1];
        else ++res[l], ++res[0], --res[r + 1];
    };
    auto joint = [&](int a, int b, int c, int d) {
        return max(min(b, d) - max(a, c) + 1, 0);
    };
    for (int i = 0; i < n * 2; ++i) {
        int l = lower_bound(b.begin(), b.end(), a[i] - d) - b.begin() + 1,
            r = upper_bound(b.begin(), b.end(), a[i] + d) - b.begin();
        if (l > r) continue;
        if (i == n) {
            if (r == n) append(1, n);
            continue;
        }
        if (i == 0) {
            if (l == 1) append(-n + 1, 0);
            continue;
        }
        int L = min({(int)(upper_bound(a.begin(), a.begin() + n, a[i]) - a.begin() - 1), i, n - 1}),
            R = max({(int)(a.size() - (upper_bound(rev.begin(), rev.begin() + n, a[i]) - rev.begin())), n + 1, i});
        for (int j = (i + n + 1) % (2 * n); (j - 1 + 2 * n) % (2 * n) != i; j = (j + 1) % (2 * n)) {
            int ct = joint(0, L, j, min(j + n - 1, n * 2 - 1)) + joint(R, n * 2 - 1, j, min(j + n - 1, n * 2 - 1));
            if (j >= n) ct += joint(0, L, 0, j - n - 1) + joint(R, n * 2 - 1, 0, j - n - 1);
            if (ct >= l && ct <= r) {
                ++res[j], --res[j + 1];
            }
        }
    }
    partial_sum(res.begin(), res.end(), res.begin());
    for (int i = 0; i < n * 2; ++i) {
        res[i] = (res[i] == n);
    }
    res.pop_back();
    return res;
}

int check(int n, vector<int> a, vector<int> b, vector<int> c, int d) {
    vector<int> f = calc(n, a, b, d), g = calc(n, a, c, d);
    for (int i = 0; i < n * 2; ++i) {
        if (f[i] && g[(i + n) % (n * 2)]) return 1;
    }
    return 0;
}

signed main() {
    int n; scanf("%d", &n);
    vector<int> a(n * 2), b(n), c(n);
    for (auto &x : a) scanf("%d", &x);
    for (auto &x : b) scanf("%d", &x);
    for (auto &x : c) scanf("%d", &x);
    sort(b.begin(), b.end()), sort(c.begin(), c.end());
    int L = 0, R = 1e9, res;
    while (L <= R) {
        int mid = (L + R) >> 1;
        if (check(n, a, b, c, mid)) res = mid, R = mid - 1;
        else L = mid + 1;
    }
    printf("%d\n", res);
    return 0;
}