#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 7;
int n;
int a[2 * N], b[N], c[N];
pair<int, int> inter(pair<int, int> a, pair<int, int> b) {
return {max(a.first, b.first), min(a.second, b.second)};
}
bool check(int mid) {
bool ret = 0;
for (int it = 0; it < 2; ++it) {
vector<int> l(2 * n + 1), r(2 * n + 1);
{
int ptrl = 1, ptrr = 0;
for (int i = 1; i <= 2 * n; ++i) {
int low = 1, high = n, sol = n + 1;
while (low <= high) {
int m = (low + high) / 2;
if (b[m] >= a[i] - mid) {
sol = m;
high = m - 1;
} else {
low = m + 1;
}
}
l[i] = sol;
low = 1, high = n, sol = 0;
while (low <= high) {
int m = (low + high) / 2;
if (b[m] <= a[i] + mid) {
sol = m;
low = m + 1;
} else {
high = m - 1;
}
}
r[i] = sol;
}
}
vector<int> lc(2 * n + 1), rc(2 * n + 1);
{
int ptrl = 1, ptrr = 0;
for (int i = 1; i <= 2 * n; ++i) {
int low = 1, high = n, sol = n + 1;
while (low <= high) {
int m = (low + high) / 2;
if (c[m] >= a[i] - mid) {
sol = m;
high = m - 1;
} else {
low = m + 1;
}
}
lc[i] = sol;
low = 1, high = n, sol = 0;
while (low <= high) {
int m = (low + high) / 2;
if (c[m] <= a[i] + mid) {
sol = m;
low = m + 1;
} else {
high = m - 1;
}
}
rc[i] = sol;
}
}
//if (it == 1) {
//for (int i = 1; i <= 2 * n; ++i) {
//cout << "B " << l[i] << " " << r[i] << "\n";
//}
//for (int i = 1; i <= 2 * n; ++i) {
//cout << "C " << l[i] << " " << r[i] << "\n";
//}
//}
vector<pair<int, int>> pref(2 * n + 2), suff(2 * n + 2);
pref[0] = {-1e9, 1e9};
int cnt = 0;
for (int i = 1; i <= 2 * n; ++i) {
++cnt;
pref[i] = inter(pref[i - 1], {lc[i] - cnt, rc[i] - cnt});
}
suff[2 * n + 1] = {-1e9, 1e9};
cnt = 0;
for (int i = 2 * n; i >= 1; --i) {
++cnt;
suff[i] = inter(suff[i + 1], {lc[i] - cnt, rc[i] - cnt});
}
vector<pair<int, int>> mid_pref(2 * n + 2), mid_suff(2 * n + 2);
mid_pref[n] = {-1e9, 1e9};
cnt = 0;
for (int i = n + 1; i <= 2 * n; ++i) {
++cnt;
mid_pref[i] = inter({mid_pref[i - 1].first - 1, mid_pref[i - 1].second - 1}, {l[i], r[i]});
}
mid_suff[n + 1] = {-1e9, 1e9};
cnt = 0;
for (int i = n; i >= 1; --i) {
++cnt;
mid_suff[i] = inter(mid_suff[i + 1], {l[i] - cnt, r[i] - cnt});
}
for (int i = 1; i <= n; ++i) {
pair<int, int> f1 = inter(pref[i - 1], {suff[i + n].first - (i - 1), suff[i + n].second - (i - 1)});
pair<int, int> f2 = inter(mid_suff[i], {mid_pref[i + n - 1].first - (n - i + 1), mid_pref[i + n - 1].second - (n - i + 1)});
if (f1.first <= f1.second && f2.first <= f2.second) {
ret = 1;
}
//if (it == 1 && i == 2) {
//cout << f2.first << " " << f2.second << "\n";
//cout << f1.first << " " << f1.second << "\n";
//}
}
for (int i = 1; i <= n; ++i) swap(b[i], c[i]);
}
return ret;
}
/*
2
1 2 6 3
2 5
3 4
*/
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= 2 * n; ++i) cin >> a[i];
for (int i = 1; i <= n; ++i) cin >> b[i];
for (int i = 1; i <= n; ++i) cin >> c[i];
sort(b + 1, b + n + 1);
sort(c + 1, c + n + 1);
//cout << check(2) << "\n";
//return 0;
int low = 0, high = 1e9, sol = 0;
while (low <= high) {
int mid = (low + high) / 2;
if (check(mid)) {
sol = mid;
high = mid - 1;
} else {
low = mid + 1;
}
}
cout << sol << "\n";
return 0;
}
